Sciweavers

869 search results - page 94 / 174
» Max-Margin Markov Networks
Sort
View
AUTOMATICA
2010
218views more  AUTOMATICA 2010»
13 years 10 months ago
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...
Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro...
MOBIHOC
2008
ACM
14 years 9 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
JMLR
2006
118views more  JMLR 2006»
13 years 10 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
JMLR
2010
202views more  JMLR 2010»
13 years 4 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
MOBIHOC
2006
ACM
14 years 9 months ago
Modeling steady-state and transient behaviors of user mobility: : formulation, analysis, and application
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
Jong-Kwon Lee, Jennifer C. Hou