Sciweavers

889 search results - page 66 / 178
» Observational Learning in Random Networks
Sort
View
UAI
2004
13 years 10 months ago
Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
Iain Murray, Zoubin Ghahramani
ATAL
2008
Springer
13 years 11 months ago
Learning task-specific trust decisions
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
Ikpeme Erete, Erin Ferguson, Sandip Sen
ICCV
2009
IEEE
13 years 7 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
ICCAD
1995
IEEE
88views Hardware» more  ICCAD 1995»
14 years 24 days ago
LOT: logic optimization with testability-new transformations using recursive learning
: A new approach to optimize multi-level logic circuits is introduced. Given a multi-level circuit, the synthesis method optimizes its area, simultaneously enhancing its random pat...
Mitrajit Chatterjee, Dhiraj K. Pradhan, Wolfgang K...
CVPR
2012
IEEE
11 years 11 months ago
Top-down visual saliency via joint CRF and dictionary learning
Top-down visual saliency facilities object localization by providing a discriminative representation of target objects and a probability map for reducing the search space. In this...
Jimei Yang, Ming-Hsuan Yang