Sciweavers

199 search results - page 15 / 40
» Model Kit for Lightweight Data Compression Algorithms
Sort
View
GIS
2008
ACM
16 years 21 days ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
84
Voted
DCC
2006
IEEE
15 years 11 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
ICASSP
2011
IEEE
14 years 3 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
MIRAGE
2007
Springer
15 years 5 months ago
Fitting Subdivision Surface Models to Noisy and Incomplete 3-D Data
Abstract. We describe an algorithm for fitting a Catmull-Clark subdivision surface model to an unstructured, incomplete and noisy data set. We complete the large missing data regi...
Spela Ivekovic, Emanuele Trucco
93
Voted
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
15 years 3 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina