Sciweavers

59 search results - page 5 / 12
» A spectral bundle method with bounds
Sort
View
ICCV
2009
IEEE
1119views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Spectral clustering of linear subspaces for motion segmentation
This paper studies automatic segmentation of multiple motions from tracked feature points through spectral embedding and clustering of linear subspaces. We show that the dimensi...
Fabien Lauer, Christoph Schn¨orr
NIPS
2008
14 years 9 days ago
Spectral Clustering with Perturbed Data
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
Ling Huang, Donghui Yan, Michael I. Jordan, Nina T...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 5 months ago
Robust controller design by convex optimization based on finite frequency samples of spectral models
Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
Gorka Galdos, Alireza Karimi, Roland Longchamp
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 4 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
COLT
2005
Springer
14 years 4 months ago
On Spectral Learning of Mixtures of Distributions
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
Dimitris Achlioptas, Frank McSherry