Sciweavers

36 search results - page 6 / 8
» Learning Fast Approximations of Sparse Coding
Sort
View
ICML
2009
IEEE
14 years 11 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
INFOCOM
2009
IEEE
14 years 5 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
NIPS
2008
14 years 8 days ago
Hebbian Learning of Bayes Optimal Decisions
Uncertainty is omnipresent when we perceive or interact with our environment, and the Bayesian framework provides computational methods for dealing with it. Mathematical models fo...
Bernhard Nessler, Michael Pfeiffer, Wolfgang Maass
CVPR
2012
IEEE
12 years 1 months ago
Beyond spatial pyramids: Receptive field learning for pooled image features
In this paper we examine the effect of receptive field designs on classification accuracy in the commonly adopted pipeline of image classification. While existing algorithms us...
Yangqing Jia, Chang Huang, Trevor Darrell
ICCV
2011
IEEE
12 years 11 months ago
The Power of Comparative Reasoning
Rank correlation measures are known for their resilience to perturbations in numeric values and are widely used in many evaluation metrics. Such ordinal measures have rarely been ...
Jay Yagnik, Dennis Strelow, David Ross, Ruei-sung ...