Sciweavers

561 search results - page 66 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
ECCV
2004
Springer
16 years 6 months ago
Characterization of Human Faces under Illumination Variations Using Rank, Integrability, and Symmetry Constraints
Photometric stereo algorithms use a Lambertian reflectance model with a varying albedo field and involve the appearances of only one object. This paper extends photometric stereo a...
Shaohua Kevin Zhou, Rama Chellappa, David W. Jacob...
ICAC
2006
IEEE
15 years 10 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
WWW
2005
ACM
16 years 5 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
ISMIR
2005
Springer
215views Music» more  ISMIR 2005»
15 years 9 months ago
Separation of Vocals from Polyphonic Audio Recordings
Source separation techniques like independent component analysis and the more recent non-negative matrix factorization are gaining widespread use for the monaural separation of in...
Shankar Vembu, Stephan Baumann
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 4 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy