Sciweavers

549 search results - page 82 / 110
» The corner arc algorithm
Sort
View
GG
2010
Springer
15 years 5 days ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
15 years 5 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
UAI
2004
15 years 14 days ago
An Empirical Evaluation of Possible Variations of Lazy Propagation
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
Andres Madsen
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
CVPR
2009
IEEE
16 years 6 months ago
Joint and Implicit Registration for Face Recognition
Contemporary face recognition algorithms rely on precise localization of keypoints (corner of eye, nose etc.). Unfortunately, finding keypoints reliably and accurately remains a...
Peng Li, Simon J. D. Prince