Sciweavers

4451 search results - page 121 / 891
» On Random Ordering Constraints
Sort
View
TCOM
2010
83views more  TCOM 2010»
14 years 11 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
ECCV
2006
Springer
16 years 6 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
ISBI
2004
IEEE
16 years 5 months ago
Speckle Reduction on Ultrasound Image by Variational Methods and Adaptive Lagrangian Multipliers
Ultrasound images are corrupted by a multiplicative noise, the speckle, which makes high level analysis difficult. Within each resolution cell a number of elementary scatterers re...
Arnaud Ogier, Pierre Hellier, Christian Barillot
SAT
2009
Springer
91views Hardware» more  SAT 2009»
15 years 11 months ago
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Probabilistic inference techniques can be used to estimate variable bias, or the proportion of solutions to a given SAT problem that fix a variable positively or negatively. Metho...
Eric I. Hsu, Sheila A. McIlraith
INFOCOM
2007
IEEE
15 years 10 months ago
A Graph-Based Model for Disconnected Ad Hoc Networks
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
Francesco De Pellegrini, Daniele Miorandi, Iacopo ...