Sciweavers

2069 search results - page 105 / 414
» Linear time algorithms for Clobber
Sort
View
ICPR
2008
IEEE
16 years 5 months ago
Robust decomposition of a digital curve into convex and concave parts
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Tristan Roussillon, Isabelle Sivignon, Laure Tougn...
129
Voted
SPIN
2007
Springer
15 years 10 months ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
GD
2001
Springer
15 years 8 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
ICCAD
2003
IEEE
205views Hardware» more  ICCAD 2003»
15 years 9 months ago
Statistical Timing Analysis for Intra-Die Process Variations with Spatial Correlations
Process variations have become a critical issue in performance verification of high-performance designs. We present a new, statistical timing analysis method that accounts for int...
Aseem Agarwal, David Blaauw, Vladimir Zolotov
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 10 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum