4526 search results - page 5 / 906 » Algorithmic problems related to the Internet |
108
click to vote
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
99
Voted
SAC
2008
ACM
14 years 12 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
64
Voted
CATS
2006
15 years 1 months ago
2006
88
Voted
APWEB
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
WADS
2007
Springer
15 years 6 months ago
2007
Springer