Sciweavers

327 search results - page 3 / 66
» Some Elimination Problems for Matrices
Sort
View
SDM
2012
SIAM
233views Data Mining» more  SDM 2012»
12 years 6 days ago
On Finding Joint Subspace Boolean Matrix Factorizations
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...
Pauli Miettinen
TCS
2008
13 years 9 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
CVPR
2007
IEEE
14 years 11 months ago
Modeling Appearances with Low-Rank SVM
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
Lior Wolf, Hueihan Jhuang, Tamir Hazan
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 3 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
CC
2002
Springer
126views System Software» more  CC 2002»
13 years 9 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof