Sciweavers

441 search results - page 74 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
NIPS
2007
13 years 11 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
ICML
2010
IEEE
13 years 11 months ago
Deep networks for robust visual recognition
Deep Belief Networks (DBNs) are hierarchical generative models which have been used successfully to model high dimensional visual data. However, they are not robust to common vari...
Yichuan Tang, Chris Eliasmith
IJCV
2008
266views more  IJCV 2008»
13 years 9 months ago
Learning to Recognize Objects with Little Supervision
This paper shows (i) improvements over state-of-the-art local feature recognition systems, (ii) how to formulate principled models for automatic local feature selection in object c...
Peter Carbonetto, Gyuri Dorkó, Cordelia Sch...
ICASSP
2011
IEEE
13 years 1 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
ICASSP
2008
IEEE
14 years 4 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin