500 search results - page 41 / 100 » Approximation algorithms for maximum independent set of pseu... |
111
click to vote
DCG
2008
15 years 1 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...
114
Voted
TCS
2008
15 years 1 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
151
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
114
click to vote
WINE
2005
Springer
15 years 7 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
130
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...