Sciweavers

411 search results - page 50 / 83
» A New Approach to the Rectilinear Steiner Tree Problem
Sort
View
IPPS
2008
IEEE
15 years 4 months ago
Junction tree decomposition for parallel exact inference
We present a junction tree decomposition based algorithm for parallel exact inference. This is a novel parallel exact inference method for evidence propagation in an arbitrary jun...
Yinglong Xia, Viktor K. Prasanna
75
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 4 months ago
Maximum Metric Spanning Tree made Byzantine Tolerant
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
ICTAI
2003
IEEE
15 years 3 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
68
Voted
CG
2000
Springer
15 years 2 months ago
Lambda-Search in Game Trees - with Application to Go
This paper proposes a new method for searching two-valued (binary) game trees in games like chess or Go. Lambda-search uses null-moves together with different orders of threat-sequ...
Thomas Thomsen
ICIP
2006
IEEE
15 years 11 months ago
Multiscale Keypoint Detection using the Dual-Tree Complex Wavelet Transform
We present a novel approach to detect multiscale keypoints using the Dual Tree Complex Wavelet Transform (DTCWT). We show that it is a well-suited basis for this problem as it is ...
Julien Fauqueur, Nick G. Kingsbury, Ryan Anderson