451 search results - page 48 / 91 » Some Lower Bounds on Geometric Separability Problems |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
IEEEMSP
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract— We consider the problem of reachback communication in wireless sensor networks: multiple sensors are deployed on a field, and they collect local measurements of some r...
ICIP
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we consider the problem of distributed compression in camera sensor networks. Due to the spatial proximity of the different cameras, acquired images can be highly d...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...