Sciweavers

104 search results - page 15 / 21
» Fast k Nearest Neighbor Search using GPU
Sort
View
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
SIAMSC
2008
168views more  SIAMSC 2008»
13 years 7 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
BIBE
2003
IEEE
183views Bioinformatics» more  BIBE 2003»
14 years 23 days ago
Effective Indexing and Filtering for Similarity Search in Large Biosequence Databases
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
Ozgur Ozturk, Hakan Ferhatosmanoglu
RECOMB
2003
Springer
14 years 7 months ago
Approximation of protein structure for fast similarity measures
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
Fabian Schwarzer, Itay Lotan
ICPR
2008
IEEE
14 years 1 months ago
On the selection of base prototypes for LAESA and TLAESA classifiers
—The k nearest neighbor (k-NN) classifier has been extensively used as a nonparametric technique in Pattern Recognition. However, in some applications where the training set is l...
Selene Hernández-Rodríguez, Jos&eacu...