Sciweavers

4886 search results - page 95 / 978
» Approximate Data Exchange
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 9 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
INTERSPEECH
2010
14 years 11 months ago
Bayesian speaker recognition using Gaussian mixture model and laplace approximation
This paper presents a Bayesian approach for Gaussian mixture model (GMM)-based speaker identification. Some approaches evaluate the speaker score of a test speech utterance using ...
Shih-Sian Cheng, I-Fan Chen, Hsin-Min Wang
FOCS
2008
IEEE
15 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 5 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
GEOINFO
2003
15 years 6 months ago
A Flexible Addressing System for Approximate Geocoding
Abstract. One of the most important features in an urban geographic information system is the ability to locate addresses, in any form employed by the population, in a quick and ef...
Clodoveu A. Davis, Frederico T. Fonseca, Karla A. ...