1576 search results - page 125 / 316 » Streaming Algorithms for Independent Sets |
DCG
2008
14 years 10 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
133
Voted
DAM
2011
14 years 5 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
123
click to vote
EUROSYS
2010
ACM
15 years 4 months ago
2010
ACM
The deluge of huge data sets such as those provided by
sensor networks, online transactions, and the web provide
exciting opportunities for data analysis. The scale of the
data ...
TON
2008
14 years 10 months ago
2008
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
124
click to vote
IPCO
2001
14 years 11 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...