Sciweavers

179 search results - page 35 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
90
Voted
SBBD
2004
89views Database» more  SBBD 2004»
14 years 10 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...
COCOON
2005
Springer
15 years 3 months ago
Quartet-Based Phylogeny Reconstruction from Gene Orders
Abstract. Phylogenetic reconstruction from gene-rearrangement data is attracting increasing attention from biologists and computer scientists. Methods used in reconstruction includ...
Tao Liu, Jijun Tang, Bernard M. E. Moret
VLDB
2004
ACM
127views Database» more  VLDB 2004»
15 years 9 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
GIS
2005
ACM
15 years 10 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
SPAA
2003
ACM
15 years 2 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder