1736 search results - page 236 / 348 » The rank-width of Directed Graphs |
197
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
We present an algorithm that extracts curves from a set of edgels within a specific class in a decreasing order of their ``length''. The algorithm inherits the perceptual...
114
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
127
click to vote
DAC
2004
ACM
16 years 5 months ago
2004
ACM
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
233
click to vote
CC
2009
Springer
16 years 5 months ago
2009
Springer
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
118
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...