Sciweavers

611 search results - page 26 / 123
» The Cardinality Matrix Constraint
Sort
View
78
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
SDM
2008
SIAM
168views Data Mining» more  SDM 2008»
14 years 11 months ago
Semi-Supervised Clustering via Matrix Factorization
The recent years have witnessed a surge of interests of semi-supervised clustering methods, which aim to cluster the data set under the guidance of some supervisory information. U...
Fei Wang, Tao Li, Changshui Zhang
FPL
2006
Springer
85views Hardware» more  FPL 2006»
15 years 1 months ago
High-Performance and Parameterized Matrix Factorization on FPGAs
FPGAs have become an attractive choice for scientific computing. In this paper, we propose a high performance design for LU decomposition, a key kernel in many scientific and engi...
Ling Zhuo, Viktor K. Prasanna
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 8 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
LICS
2010
IEEE
14 years 8 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...