Sciweavers

381 search results - page 15 / 77
» Fast Neighbor Joining
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 1 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 4 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
15 years 4 months ago
Compact Similarity Joins
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
Brent Bryan, Frederick Eberhardt, Christos Falouts...
WIOPT
2006
IEEE
15 years 3 months ago
Analyzing the impact of neighbor sensing on the performance of the OLSR protocol
— This paper presents an analysis of several neighbor sensing approaches for the OLSR routing protocol. While several performance studies of OLSR proceed this work, few attention...
Michael Voorhaen, Chris Blondia
PAMI
2008
208views more  PAMI 2008»
14 years 9 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...