2698 search results - page 335 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
167
click to vote
WAW
2007
Springer
16 years 19 days ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
156
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, we argue that for a C-class classification problem, C 2-class classifiers, each of which discriminating one class from the other classes and having a characteristic ...
171
click to vote
JAIR
2008
15 years 6 months ago
2008
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
169
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
181
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...