87 search results - page 17 / 18 » focs 2008 |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
JACM
2007
13 years 5 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...