137 search results - page 19 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
AAAI
2006
13 years 9 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
13 years 8 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
COMPGEOM
2010
ACM
14 years 1 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...