7015 search results - page 330 / 1403 » Approximation algorithms for co-clustering |
188
click to vote
TFS
2008
15 years 5 months ago
2008
Some errors in our original paper in defining relative reduct with information measures are pointed out in this paper. It is shown that in our original work, Theorems 10 and 19 hol...
281
click to vote
ORL
2011
15 years 1 months ago
2011
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
194
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
264
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
165
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...