210 search results - page 33 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
TKDE
2010
13 years 5 months ago
2010
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
ICRA
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
3DIM
1997
IEEE
13 years 11 months ago
1997
IEEE
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...