Sciweavers

9284 search results - page 478 / 1857
» Knowledge State Algorithms
Sort
View
ECCV
2000
Springer
15 years 12 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth
CORR
2009
Springer
114views Education» more  CORR 2009»
15 years 5 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
178
Voted
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
16 years 13 hour ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
168
Voted
IJCAI
2001
15 years 9 months ago
Reviving Partial Order Planning
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
XuanLong Nguyen, Subbarao Kambhampati
CSJM
2008
65views more  CSJM 2008»
15 years 6 months ago
A New Attempt On The F5 Criterion
Faug`ere's criterion used in the F5 algorithm is still not understand and thus there are not many implementations of this algorithm. We state its proof using syzygies to expl...
Christian Eder