1100 search results - page 97 / 220 » Approximate distance oracles |
ECCV
2008
Springer
16 years 6 hour ago
2008
Springer
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our techniqu...
102
Voted
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
68
Voted
SMC
2007
IEEE
15 years 4 months ago
2007
IEEE
— In this paper we propose a new technique allowing to map descriptive data into relative distance space, which is based primarily on senses of the terms stored in our data. We u...
IJIT
2004
14 years 11 months ago
2004
A fuzzy classifier using multiple ellipsoids approximating decision regions for classification is to be designed in this paper. An algorithm called Gustafson-Kessel algorithm (GKA)...
112
click to vote
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...