347 search results - page 12 / 70 » The Berlekamp-Massey Algorithm revisited |
PR
2006
14 years 10 months ago
2006
The main goal of this work is to compare pyramidal structures proposed to solve segmentation tasks. Segmentation algorithms based on regular and irregular pyramids are described, ...
76
Voted
GD
2003
Springer
15 years 4 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
LCPC
2005
Springer
15 years 4 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
CP
2008
Springer
15 years 17 days ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
