76 search results - page 15 / 16 » On the Complexity of Matrix Rank and Rigidity |
CORR
2011
Springer
12 years 9 months ago
2011
Springer
: We review the singular value decomposition (SVD) and discuss some lesser-known applications of it that we find particularly interesting. We also discuss generalizations of the S...
APPROX
2009
Springer
14 years 25 days ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
JMIV
2006
13 years 6 months ago
2006
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
BMCBI
2006
13 years 6 months ago
2006
Background: Microarray technology produces gene expression data on a genomic scale for an endless variety of organisms and conditions. However, this vast amount of information nee...