Sciweavers

4886 search results - page 54 / 978
» Approximate Data Exchange
Sort
View
DAGSTUHL
1997
15 years 5 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
Robert Mencl, Heinrich Müller
COMPGEOM
2010
ACM
15 years 9 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
JCST
2008
175views more  JCST 2008»
15 years 4 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
INFOCOM
2012
IEEE
13 years 6 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
238
Voted
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 5 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra