Sciweavers

280 search results - page 42 / 56
» Binary Matrix Factorization with Applications
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
INTERSPEECH
2010
13 years 2 months ago
A factorial sparse coder model for single channel source separation
We propose a probabilistic factorial sparse coder model for single channel source separation in the magnitude spectrogram domain. The mixture spectrogram is assumed to be the sum ...
Robert Peharz, Michael Stark, Franz Pernkopf, Yann...
ICML
2006
IEEE
14 years 8 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller
CEC
2005
IEEE
14 years 1 months ago
A quantitative approach for validating the building-block hypothesis
The building blocks are common structures of high-quality solutions. Genetic algorithms often assume the building-block hypothesis. It is hypothesized that the high-quality solutio...
Chatchawit Aporntewan, Prabhas Chongstitvatana
VLSID
1996
IEEE
132views VLSI» more  VLSID 1996»
13 years 11 months ago
A study of composition schemes for mixed apply/compose based construction of ROBDDs
Reduced Ordered Binary Decision Diagrams ROBDDs have traditionally been built in a bottom-up fashion. In this scheme, the intermediate peak memory utilization is often larger than...
Amit Narayan, Sunil P. Khatri, Jawahar Jain, Masah...