Zobrazeno 1 - 10
of 746
pro vyhledávání: '"Karlsson, Lars"'
We consider the problem of ranking a set of objects based on their performance when the measurement of said performance is subject to noise. In this scenario, the performance is measured repeatedly, resulting in a range of measurements for each objec
Externí odkaz:
http://arxiv.org/abs/2405.18259
For a given product of $n$ matrices, the matrix chain multiplication problem asks for a parenthesisation that minimises the number of arithmetic operations. In 1973, Godbole presented a now classical dynamic programming formulation with cubic time co
Externí odkaz:
http://arxiv.org/abs/2303.17352
Publikováno v:
Francisco L\'opez, Lars Karlsson, and Paolo Bientinesi. 2022. FLOPs as a Discriminant for Dense Linear Algebra Algorithms. In 51st International Conference on Parallel Processing (ICPP'22), August 29-September 1, 2022, Bordeaux, France
Expressions that involve matrices and vectors, known as linear algebra expressions, are commonly evaluated through a sequence of invocations to highly optimised kernels provided in libraries such as BLAS and LAPACK. A sequence of kernels represents a
Externí odkaz:
http://arxiv.org/abs/2207.02070
The Canonical Polyadic (CP) tensor decomposition is frequently used as a model in applications in a variety of different fields. Using jackknife resampling to estimate parameter uncertainties is often desirable but results in an increase of the alrea
Externí odkaz:
http://arxiv.org/abs/2112.03985
Tensors (also commonly seen as multi-linear operators or as multi-dimensional arrays) are ubiquitous in scientific computing and in data science, and so are the software efforts for tensor operations. Particularly in recent years, we have observed an
Externí odkaz:
http://arxiv.org/abs/2103.13756
Autor:
Walser, Marion, Karlsson, Lars, Motalleb, Reza, Isgaard, Jörgen, Kuhn, H Georg, Åberg, N. David
Publikováno v:
In Heliyon 15 January 2024 10(1)
Tensor decompositions, such as CANDECOMP/PARAFAC (CP), are widely used in a variety of applications, such as chemometrics, signal processing, and machine learning. A broadly used method for computing such decompositions relies on the Alternating Leas
Externí odkaz:
http://arxiv.org/abs/2010.04678
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Skibniewski, Mikolaj, Venetsanos, Dimitrios, Ahlsson, Anders, Batra, Gorav, Friberg, Örjan, Hofmann, Robin, Janzon, Magnus, Karlsson, Lars O, Lawesson, Sofia Sederholm, Nielsen, Susanne J., Jeppsson, Anders, Alfredsson, Joakim
Publikováno v:
In American Heart Journal March 2023 257:69-77