736 search results - page 17 / 148 » A dynamic data structure for approximate range searching |
ICSE
2010
IEEE-ACM
14 years 1 months ago
2010
IEEE-ACM
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
VIS
2005
IEEE
14 years 10 months ago
2005
IEEE
High resolution volumes require high precision compositing to preserve detailed structures. This is even more desirable for volumes with high dynamic range values. After the high ...
ACSC
2006
IEEE
14 years 3 months ago
2006
IEEE
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
SODA
1994
ACM
13 years 10 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...