Sciweavers

1038 search results - page 27 / 208
» Space-Bounded Query Approximation
Sort
View
SOFTWARE
2002
14 years 11 months ago
A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
Rolf Haenni
EDBT
2002
ACM
188views Database» more  EDBT 2002»
15 years 11 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
PERCOM
2005
ACM
15 years 5 months ago
A Distributed System for Answering Range Queries on Sensor Network Data
A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query an...
Alfredo Cuzzocrea, Filippo Furfaro, Sergio Greco, ...
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 22 days ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
109
Voted
ISAAC
2007
Springer
156views Algorithms» more  ISAAC 2007»
15 years 5 months ago
Approximate Range Searching in External Memory
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
Micha Streppel, Ke Yi