Sciweavers

186 search results - page 14 / 38
» Fast Computation of Sparse Datacubes
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Sparse probabilistic regression for activity-independent human pose inference
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
Raquel Urtasun, Trevor Darrell
DAC
2000
ACM
14 years 9 months ago
Fast methods for extraction and sparsification of substrate coupling
The sudden increase in systems-on-a-chip designs has renewed interest in techniques for analyzing and eliminating substrate coupling problems. Previous work on the substrate coupl...
Joe Kanapka, Joel R. Phillips, Jacob White
DAC
2009
ACM
14 years 13 days ago
Fast vectorless power grid verification using an approximate inverse technique
Power grid verification in modern integrated circuits is an integral part of early system design where adjustments can be most easily incorporated. In this work, we describe an ea...
Nahi H. Abdul Ghani, Farid N. Najm
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 6 months ago
Learning Preferences with Millions of Parameters by Enforcing Sparsity
We study the retrieval task that ranks a set of objects for a given query in the pairwise preference learning framework. Recently researchers found out that raw features (e.g. word...
Xi Chen, Bing Bai, Yanjun Qi, Qihang Lin, Jaime G....
SIAMNUM
2011
102views more  SIAMNUM 2011»
12 years 11 months ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich