Sciweavers

1497 search results - page 77 / 300
» A Computational Model for Message Passing
Sort
View
NIPS
2008
13 years 10 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
CVPR
2012
IEEE
11 years 11 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
ICASSP
2011
IEEE
13 years 1 months ago
Variational approximation of long-span language models for lvcsr
Long-span language models that capture syntax and semantics are seldom used in the first pass of large vocabulary continuous speech recognition systems due to the prohibitive sea...
Anoop Deoras, Tomas Mikolov, Stefan Kombrink, Mart...
WOA
2001
13 years 10 months ago
A Contract Decommitment Protocol for Automated Negotiation in Time Variant Environments
Negotiation is a fundamental mechanism in distributed multi-agent systems. Since negotiation is a time-spending process, in many scenarios agents have to take into account the pas...
Federico Bergenti, Agostino Poggi, Matteo Somacher
ECOOPW
1994
Springer
14 years 1 months ago
Abstracting Interactions Based on Message Sets
ing Interactions Based on Message Sets Svend Frr 1 and Gul Agha2. 1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303 2 University of Illinois, 1304 W. Springf...
Svend Frølund, Gul Agha