Sciweavers

844 search results - page 117 / 169
» Truncated Message Passing
Sort
View
ICML
2007
IEEE
14 years 9 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
ICML
2008
IEEE
14 years 9 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
WWW
2005
ACM
14 years 9 months ago
MiSpider: a continuous agent on web pages
In this paper, we propose a Web based agent system called MiSpider, which provides intelligent web services on web browsers. MiSpider enables users to use agents on existing brows...
Yujiro Fukagaya, Tadachika Ozono, Takayuki Ito, To...
PODC
2009
ACM
14 years 9 months ago
Dynamic atomic storage without consensus
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...
Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkh...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
14 years 9 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...