Sciweavers

2643 search results - page 4 / 529
» Higher order messaging
Sort
View
UAI
2008
13 years 11 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
JCM
2010
126views more  JCM 2010»
13 years 8 months ago
Adding Redundancy to Replication in Window-aware Delay-tolerant Routing
— This paper presents a resource-efficient protocol for opportunistic routing in delay-tolerant networks (DTN). First, our approach exploits the context of mobile nodes (speed, ...
Gabriel Sandulescu, Simin Nadjm-Tehrani
GROUP
2005
ACM
14 years 3 months ago
Unraveling the ordering in persistent chat: a new message ordering feature
A common problem in chat is that the chat display only reveals the temporal order of the conversation. A better user interface is desired that reveals the logical order of the mes...
Lu Xiao, Jayne S. Litzinger
DAGSTUHL
1994
13 years 11 months ago
A High Performance Totally Ordered Multicast Protocol
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service su...
Brian Whetten, Todd Montgomery, Simon M. Kaplan
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...