96 search results - page 16 / 20 » Length-bounded cuts and flows |
140
Voted
ICCAD
2004
IEEE
16 years 8 days ago
2004
IEEE
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
128
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
119
click to vote
DISOPT
2008
15 years 3 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
119
click to vote
ECCV
2006
Springer
16 years 5 months ago
2006
Springer
We introduce a new approach to modelling gradient flows of contours and surfaces. While standard variational methods (e.g. level sets) compute local interface motion in a different...
164
click to vote
JPDC
2006
15 years 3 months ago
2006
This paper presents a new spectral template-matching approach to countering shrew distributed denial-of-service (DDoS) attacks. These attacks are stealthy, periodic, pulsing, and ...