Sciweavers

360 search results - page 37 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 1 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
BMCBI
2010
132views more  BMCBI 2010»
13 years 7 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
DAWAK
2001
Springer
14 years 3 days ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
PODS
1998
ACM
152views Database» more  PODS 1998»
13 years 12 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
14 years 9 months ago
Indexing Spatio-Temporal Data Warehouses
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zh...