20 search results - page 3 / 4 » A Compression Algorithm for Large Arity Extensional Constrai... |
150
click to vote
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
136
Voted
SIGIR
2011
ACM
14 years 4 months ago
2011
ACM
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
127
Voted
MIRAGE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
131
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Sparse representations using overcomplete dictionaries are used in a variety of field such as pattern recognition and compression. However, the size of dictionary is usually a tra...
154
Voted
SIAMREV
2010
14 years 8 months ago
2010
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 ...