Sciweavers

3172 search results - page 521 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
ICTAC
2010
Springer
15 years 4 months ago
Preference and Non-deterministic Choice
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Bill Stoddart, Frank Zeyda, Steve Dunne
EDBT
1998
ACM
155views Database» more  EDBT 1998»
15 years 10 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICRA
1994
IEEE
236views Robotics» more  ICRA 1994»
15 years 10 months ago
Neptune: Above-Ground Storage Tank Inspection Robot System
act The Neptune system is a mobile robot system used to remotely inspect above-ground storage tanks (ASTs) while immersed in the petroleum product, in order to ascertain from the i...
Hagen Schempf
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 10 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman