451 search results - page 40 / 91 » Some Lower Bounds on Geometric Separability Problems |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
COLT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...