Sciweavers

7129 search results - page 709 / 1426
» Approximation Algorithms for Treewidth
Sort
View
TACAS
1997
Springer
197views Algorithms» more  TACAS 1997»
15 years 11 months ago
Design/CPN - A Computer Tool for Coloured Petri Nets
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Søren Christensen, Jens Bæk Jø...
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
CAAN
2006
Springer
15 years 11 months ago
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
Guy Even, Shimon Shahar
DATE
2004
IEEE
108views Hardware» more  DATE 2004»
15 years 11 months ago
Poor Man's TBR: A Simple Model Reduction Scheme
This paper presents a model reduction algorithm motivated by a connection between frequency domain projection methods and approximation of truncated balanced realizations. The met...
Joel R. Phillips, Luis Miguel Silveira
DAGM
2006
Springer
15 years 11 months ago
Provably Correct Edgel Linking and Subpixel Boundary Reconstruction
Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algo...
Ullrich Köthe, Peer Stelldinger, Hans Meine