Sciweavers

312 search results - page 15 / 63
» The Analysis of a Probabilistic Approach to Nearest Neighbor...
Sort
View
ACCV
2007
Springer
14 years 18 days ago
Efficient Search in Document Image Collections
This paper presents an efficient indexing and retrieval scheme for searching in document image databases. In many non-European languages, optical character recognizers are not very...
Anand Kumar 0002, C. V. Jawahar, R. Manmatha
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 10 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
13 years 10 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
ICASSP
2011
IEEE
13 years 9 days ago
Evaluating music sequence models through missing data
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
Thierry Bertin-Mahieux, Graham Grindlay, Ron J. We...
DAS
2010
Springer
14 years 18 days ago
Nearest neighbor based collection OCR
Conventional optical character recognition (OCR) systems operate on individual characters and words, and do not normally exploit document or collection context. We describe a Coll...
K. Pramod Sankar, C. V. Jawahar, Raghavan Manmatha