Sciweavers

4850 search results - page 133 / 970
» Approximate Data Structures with Applications
Sort
View
FUIN
2002
108views more  FUIN 2002»
14 years 9 months ago
Approximate Entropy Reducts
We use information entropy measure to extend the rough set based notion of a reduct. We introduce the Approximate Entropy Reduction Principle (AERP). It states that any simplificat...
Dominik Slezak
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
14 years 11 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
15 years 3 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
PVLDB
2010
134views more  PVLDB 2010»
14 years 8 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...
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 1 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani