3875 search results - page 277 / 775 » Approximation algorithms for the 0-extension problem |
217
click to vote
WWW
2010
ACM
16 years 2 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
183
click to vote
CPM
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
216
Voted
ICCAD
1993
IEEE
15 years 12 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
191
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
209
click to vote
SDM
2003
SIAM
15 years 9 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...