Sciweavers

3575 search results - page 128 / 715
» Structured motifs search
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 9 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
IPTPS
2004
Springer
15 years 12 months ago
The Case for a Hybrid P2P Search Infrastructure
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. Whil...
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M....
ADBIS
2000
Springer
79views Database» more  ADBIS 2000»
15 years 11 months ago
Distributed Searching of k-Dimensional Data with Almost Constant Costs
Abstract. In this paper we consider the dictionary problem in the scalable distributed data structure paradigm introduced by Litwin, Neimat and Schneider and analyze costs for inse...
Adriano Di Pasquale, Enrico Nardelli
DCC
2008
IEEE
16 years 6 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
EDBT
2009
ACM
108views Database» more  EDBT 2009»
15 years 11 months ago
Reverse k-nearest neighbor search in dynamic and general metric databases
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Elke Achtert, Hans-Peter Kriegel, Peer Kröger...