Sciweavers

7006 search results - page 1207 / 1402
» Approximation Algorithms
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 6 months ago
Gowers uniformity, influence of variables, and PCPs
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
Alex Samorodnitsky, Luca Trevisan
ALGORITHMICA
2011
15 years 1 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
CVPR
2009
IEEE
17 years 1 months ago
Automated Feature Extraction for Early Detection of Diabetic Retinopathy in Fundus Images
Automated detection of lesions in retinal images can assist in early diagnosis and screening of a common disease: Diabetic Retinopathy. A robust and computationally efficient ap...
Saiprasad Ravishankar (University of Illinois Urba...
CVPR
2009
IEEE
17 years 1 months ago
On Compositional Image Alignment with an Application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositional ...
Brian Amberg (University of Basel), Andrew Blake (...
« Prev « First page 1207 / 1402 Last » Next »