Sciweavers

441 search results - page 63 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
CVPR
2006
IEEE
15 years 12 months ago
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov r...
Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, ...
ICASSP
2008
IEEE
15 years 4 months ago
Unsupervised learning of auditory filter banks using non-negative matrix factorisation
Non-negative matrix factorisation (NMF) is an unsupervised learning technique that decomposes a non-negative data matrix into a product of two lower rank non-negative matrices. Th...
Alexander Bertrand, Kris Demuynck, Veronique Stout...
TVLSI
2002
95views more  TVLSI 2002»
14 years 9 months ago
Efficient inductance extraction using circuit-aware techniques
We propose two practical approaches for on-chip inductance extraction to obtain a highly sparsified and accurate inverse inductance matrix K. Both approaches differ from previous ...
Haitian Hu, Sachin S. Sapatnekar
CORR
2006
Springer
123views Education» more  CORR 2006»
14 years 10 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
ICCV
2009
IEEE
16 years 26 days ago
Radiometric Compensation using Stratified Inverses
Through radiometric compensation, a projector-camera system can project a desired image onto a non-flat and nonwhite surface. This can be achieved by computing the inverse light tr...
Tian-Tsong Ng, Ramanpreet S. Pahwa, Jiamin Bai, To...