869 search results - page 16 / 174 » Max-Margin Markov Networks |
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...
WINET
2002
14 years 9 months ago
2002
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Structured Peer to Peer (P2P) overlay networks are becoming increasingly popular. Multi-hop systems achieve a successful lookup in O(log N) hops, whereas one-hop systems approa...
UAI
2001
14 years 11 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
102
click to vote
TSP
2010
14 years 4 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...