7129 search results - page 738 / 1426 » Approximation Algorithms for Treewidth |
195
click to vote
IJON
2010
15 years 1 months ago
2010
This paper presents a novel methodology to infer parameters of probabilistic models whose output noise is a Student-t distribution. The method is an extension of earlier work for ...
213
Voted
INFORMATICALT
2010
15 years 1 months ago
2010
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
152
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this article we are interested in the derivation of efficient domain decomposition methods for the viscous primitive equations of the ocean. We consider the rotating 3d incompre...
239
Voted
TIT
2010
15 years 1 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
177
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
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...