Sciweavers

14158 search results - page 436 / 2832
» Generalized switch-setting problems
Sort
View
JMLR
2012
13 years 8 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
CVPR
2012
IEEE
13 years 8 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
16 years 9 days ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
VLDB
2001
ACM
86views Database» more  VLDB 2001»
15 years 10 months ago
Intelligent Rollups in Multidimensional OLAP Data
In this paper we propose a new operator for advanced exploration of large multidimensional databases. The proposed operator can automatically generalize from a specific problem c...
Gayatri Sathe, Sunita Sarawagi
TOG
2008
89views more  TOG 2008»
15 years 6 months ago
Continuation methods for adapting simulated skills
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...
KangKang Yin, Stelian Coros, Philippe Beaudoin, Mi...