259 search results - page 38 / 52 » Clustering for Approximate Similarity Search in High-Dimensi... |
74
Voted
INTERSPEECH
2010
14 years 4 months ago
2010
One of the difficult problems of acoustic modeling for Automatic Speech Recognition (ASR) is how to adequately model the wide variety of acoustic conditions which may be present i...
95
Voted
ERCIMDL
2000
Springer
15 years 1 months ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
246
click to vote
ICDAR
2011
IEEE
13 years 9 months ago
2011
IEEE
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
112
click to vote
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...