Sciweavers

267 search results - page 27 / 54
» Efficient and decentralized computation of approximate globa...
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
Beyond Trees: MRF Inference via Outer-Planar Decomposition
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
Dhruv Batra, Andrew Gallagher, Devi Parikh, Tsuhan...
NOMS
2006
IEEE
119views Communications» more  NOMS 2006»
15 years 5 months ago
Runtime Semantic Interoperability for Gathering Ontology-based Network Context
—The trends for pushing more operational intelligence towards network elements to achieve more context-aware and self-managing behavior often requires elements to gather network ...
John Keeney, David Lewis, Declan O'Sullivan, Antoi...
IPPS
2007
IEEE
15 years 6 months ago
Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
: Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system ...
Runfang Zhou, Kai Hwang
ADHOC
2010
292views more  ADHOC 2010»
14 years 12 months ago
Sleep/wake scheduling for multi-hop sensor networks: Non-convexity and approximation algorithm
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
Yan Wu, Sonia Fahmy, Ness B. Shroff
UAI
2004
15 years 1 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...