1100 search results - page 170 / 220 » Approximate distance oracles |
117
click to vote
MM
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
ICDAR
1999
IEEE
15 years 2 months ago
1999
IEEE
Abstract. This paper describes a method for correction of optically read Devanagari character strings using a Hindi word dictionary. The word dictionary is partitioned in order to ...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
123
click to vote
COMPGEOM
2011
ACM
14 years 1 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
100
click to vote
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...