Sciweavers

885 search results - page 128 / 177
» Random Matrices in Data Analysis
Sort
View
IJCV
2010
169views more  IJCV 2010»
13 years 6 months ago
Rigid Structure from Motion from a Blind Source Separation Perspective
We present an information theoretic approach to define the problem of structure from motion (SfM) as a blind source separation one. Given that for almost all practical joint densi...
Jeff Fortuna, Aleix M. Martínez
26
Voted
ICCV
1999
IEEE
14 years 9 months ago
Segmentation using Eigenvectors: A Unifying View
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
Yair Weiss
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
14 years 2 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
14 years 1 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 4 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...