Sciweavers

764 search results - page 78 / 153
» Maximum-Margin Matrix Factorization
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 4 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
JDS
2007
85views more  JDS 2007»
15 years 3 months ago
A Simple Tool to Assist in Agile Methodology Adoption Decisions
This paper describes the development of a decision support tool, an adoption assessment matrix based on critical adoption factors, that addresses a need in industry; namely, to im...
John McAvoy, David Sammon, Ian Owens
ICCV
2005
IEEE
15 years 9 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 11 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CVPR
2000
IEEE
16 years 6 months ago
Recovering Non-Rigid 3D Shape from Image Streams
This paper addresses the problem of recovering 3D non-rigid shape models from image sequences. For example, given a video recording of a talking person, we would like to estimate ...
Christoph Bregler, Aaron Hertzmann, Henning Bierma...