Sciweavers

2880 search results - page 88 / 576
» Approximate Range Searching
Sort
View
127
Voted
3DPVT
2002
IEEE
173views Visualization» more  3DPVT 2002»
15 years 8 months ago
Edge-Constrained Marching Triangles
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
Neil H. McCormick, Robert B. Fisher
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 7 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu
CORR
2007
Springer
89views Education» more  CORR 2007»
15 years 3 months ago
Speeding up Simplification of Polygonal Curves using Nested Approximations
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
Pierre-Francois Marteau, Gildas Ménier
EVOW
2009
Springer
15 years 10 months ago
Evolving Approximate Image Filters
Image filtering involves taking a digital image and producing a new image from it. In software packages such as Adobe’s Photoshop, image filters are used to produce artistic ve...
Simon Colton, Pedro Torres
SCCC
2003
IEEE
15 years 8 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes