7015 search results - page 353 / 1403 » Approximation algorithms for co-clustering |
164
Voted
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
200
Voted
ISAAC
2005
Springer
16 years 28 days ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
228
Voted
WAOA
2005
Springer
16 years 27 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
180
Voted
APPROX
2004
Springer
16 years 25 days ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
208
click to vote
JCO
2011
15 years 2 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...