Sciweavers

146 search results - page 18 / 30
» Consistency Techniques for Numeric CSPs
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 5 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
HASKELL
2006
ACM
14 years 21 days ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
NA
2010
85views more  NA 2010»
13 years 5 months ago
The reliability/cost trade-off for a class of ODE solvers
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...
Wayne H. Enright, Li Yan
IPPS
2006
IEEE
14 years 23 days ago
Algorithm-based checkpoint-free fault tolerance for parallel matrix computations on volatile resources
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
Zizhong Chen, Jack Dongarra
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 1 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo