Sciweavers

6315 search results - page 916 / 1263
» Approximating Solution Structure
Sort
View
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
16 years 5 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 5 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 5 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 5 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...