Sciweavers

764 search results - page 42 / 153
» Maximum-Margin Matrix Factorization
Sort
View
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
15 years 3 months ago
The Phase Matrix
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
Peter Høyer
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
ICONIP
2007
14 years 11 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
IEEEMSP
2002
IEEE
15 years 2 months ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
CVPR
2005
IEEE
15 years 12 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade