Sciweavers

4886 search results - page 119 / 978
» Approximate Data Exchange
Sort
View
VC
2008
88views more  VC 2008»
15 years 4 months ago
Evolution of T-spline level sets for meshing non-uniformly sampled and incomplete data
Given a large set of unorganized point sample data, we propose a new framework for computing a triangular mesh representing an approximating piecewise smooth surface. The data may ...
Huaiping Yang, Bert Jüttler
161
Voted
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 5 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
15 years 8 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
PVLDB
2010
134views more  PVLDB 2010»
15 years 3 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 6 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...