2698 search results - page 245 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
190
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
180
click to vote
WWW
2010
ACM
16 years 1 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...
207
click to vote
TNN
2008
15 years 6 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
166
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
188
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...