7015 search results - page 391 / 1403 » Approximation algorithms for co-clustering |
173
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
377
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
194
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
189
click to vote
COMPUTING
2006
15 years 6 months ago
2006
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
148
click to vote
IJCAI
1997
15 years 8 months ago
1997
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...