Sciweavers

811 search results - page 54 / 163
» Avoiding Approximate Squares
Sort
View
PAMI
2007
214views more  PAMI 2007»
13 years 7 months ago
2D Affine-Invariant Contour Matching Using B-Spline Model
—This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the nonuniqueness of B-Spline in curve matching. This metho...
Yue Wang, Eam Khwang Teoh
CGF
2002
94views more  CGF 2002»
13 years 7 months ago
Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method
We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have al...
Faramarz F. Samavati, N. Mahdavi-Amiri, Richard M....
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
14 years 1 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
LATIN
1998
Springer
13 years 12 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro