806 search results - page 79 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
106
click to vote
APIN
2007
15 years 1 months ago
2007
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
179
click to vote
PODS
1997
ACM
15 years 5 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
PVLDB
2010
14 years 12 months ago
2010
The huge amount of temporal data generated from many important applications call for a highly efficient and scalable version index. The TSB-tree has the potential of large scalab...
121
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
131
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...