Sciweavers

764 search results - page 121 / 153
» Maximum-Margin Matrix Factorization
Sort
View
FOCS
2005
IEEE
14 years 2 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
BMCBI
2007
105views more  BMCBI 2007»
13 years 8 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
13 years 7 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
CVPR
2008
IEEE
14 years 10 months ago
Non-negative graph embedding
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
Jianchao Yang, Shuicheng Yan, Yun Fu, Xuelong Li, ...
ICCV
2005
IEEE
14 years 10 months ago
Passive Photometric Stereo from Motion
We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Star...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, David J....