2698 search results - page 209 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
214
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
189
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
187
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
202
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Online social network has developed significantly in recent years as a medium of communicating, sharing and disseminating information and spreading influence. Most of current resea...
182
click to vote
FLAIRS
2008
15 years 8 months ago
2008
The standard kNN algorithm suffers from two major drawbacks: sensitivity to the parameter value k, i.e., the number of neighbors, and the use of k as a global constant that is ind...