6105 search results - page 820 / 1221 » A Parallel Algorithm for Bound-Smoothing |
196
Voted
AAAI
1990
15 years 8 months ago
1990
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
199
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
196
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
203
click to vote
IJBRA
2006
15 years 6 months ago
2006
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
119
click to vote
JPDC
2006
15 years 6 months ago
2006
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...