4886 search results - page 162 / 978 » Approximate Data Exchange |
182
click to vote
BMVC
1998
15 years 7 months ago
1998
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
147
click to vote
CCCG
1993
15 years 7 months ago
1993
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
167
Voted
TKDE
2002
15 years 5 months ago
2002
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
179
Voted
MP
2010
15 years 4 months ago
2010
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
175
Voted
DASFAA
2009
IEEE
16 years 29 days ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...