Sciweavers

244 search results - page 7 / 49
» Compressive PCA on Graphs
Sort
View
ICRA
2002
IEEE
110views Robotics» more  ICRA 2002»
15 years 2 months ago
Mobile Robot Localization using an Incremental Eigenspace Model
— When using appearance-based recognition for self-localization of mobile robots, the images obtained during the exploration of the environment need to be efficiently stored in t...
Matej Artac, Matjaz Jogan, Ales Leonardis
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
15 years 6 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ICML
2007
IEEE
15 years 10 months ago
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
Sridhar Mahadevan
103
Voted
CORR
2006
Springer
127views Education» more  CORR 2006»
14 years 9 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi