Sciweavers

167 search results - page 26 / 34
» Nearest Neighbor Queries in Metric Spaces
Sort
View
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
14 years 7 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 8 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ICMCS
2007
IEEE
214views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Exploring Discriminative Learning for Text-Independent Speaker Recognition
Speaker verification is a technology of verifying the claimed identity of a speaker based on the speech signal from the speaker (voice print). To learn the score of similarity be...
Ming Liu, Zhengyou Zhang, Mark Hasegawa-Johnson, T...
ICPP
2006
IEEE
14 years 1 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
14 years 7 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...