Sciweavers

230 search results - page 6 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 7 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
ADC
2000
Springer
182views Database» more  ADC 2000»
13 years 11 months ago
Efficient Range Query Retrieval for Non-Uniform Data Distributions
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into a...
Salahadin Mohammed, Evan P. Harris, Kotagiri Ramam...
IM
2007
13 years 7 months ago
Inverted Index Support for Numeric Search
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...
LCN
2008
IEEE
14 years 1 months ago
Range queries and load balancing in a hierarchically structured P2P system
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
Simon Rieche, Bui The Vinh, Klaus Wehrle
ECSQARU
2005
Springer
14 years 29 days ago
On the Use of Restrictions for Learning Bayesian Networks
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
Luis M. de Campos, Javier Gomez Castellano