Sciweavers

237 search results - page 30 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
UAI
2000
13 years 9 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...
MICCAI
2008
Springer
14 years 8 months ago
Nonrigid Registration of Dynamic Renal MR Images Using a Saliency Based MRF Model
Nonrigid registration of contrast-enhanced MR images is a difficult problem due to the change in pixel intensity caused by the washin and wash-out of the contrast agent. In this pa...
Dwarikanath Mahapatra, Ying Sun
ECAI
2008
Springer
13 years 9 months ago
Generating Diagnoses from Conflict Sets with Continuous Attributes
Abstract. Many techniques in model-based diagnosis and other research fields find the hitting sets of a group of sets. Existing techniques apply to sets of finite elements only. Th...
Emmanuel Benazera, Louise Travé-Massuy&egra...
DLT
2006
13 years 9 months ago
On Critical Exponents in Fixed Points of Non-erasing Morphisms
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
Dalia Krieger