Sciweavers

1403 search results - page 85 / 281
» About Approximations of Exponentials
Sort
View
JMLR
2010
118views more  JMLR 2010»
14 years 7 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
95
Voted
SIAMCO
2010
114views more  SIAMCO 2010»
14 years 7 months ago
Discrete Carleman Estimates for Elliptic Operators in Arbitrary Dimension and Applications
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
Franck Boyer, Florence Hubert, Jérôme...
105
Voted
SIAMMA
2010
122views more  SIAMMA 2010»
14 years 7 months ago
Asymptotic Flocking Dynamics for the Kinetic Cucker-Smale Model
In this paper, we analyse the asymptotic behavior of solutions of the continuous kinetic version of flocking by Cucker and Smale [16], which describes the collective behavior of an...
J. A. Carrillo, M. Fornasier, J. Rosado, G. Toscan...
122
Voted
SIAMMAX
2010
97views more  SIAMMAX 2010»
14 years 7 months ago
Krylov Subspace Methods for Linear Systems with Tensor Product Structure
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
Daniel Kressner, Christine Tobler
106
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...