620 search results - page 35 / 124 » Likelihood Computations Using Value Abstraction |
COORDINATION
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this p...
MICCAI
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. A central problem in the analysis of functional magnetic resonance imaging (fMRI) data is the reliable detection and segmentation of activated areas. Often this goal is a...
NPL
1998
13 years 9 months ago
1998
Abstract. The resolution of combinatorial optimization problems can greatly benefit from the parallel and distributed processing which is characteristic of neural network paradigm...
CP
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
CDC
2008
IEEE
13 years 12 months ago
2008
IEEE
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...