2822 search results - page 120 / 565 » Global Optimization of Histograms |
142
Voted
DAC
2000
ACM
16 years 1 months ago
2000
ACM
FPGA routing resources typically consist of segments of various lengths. Due to the segmented routing architectures, the traditional measure of wiring cost (wirelength, delay, con...
82
Voted
ICCD
2000
IEEE
15 years 9 months ago
2000
IEEE
We present a local clocking mechanism based on a tunable delay line which calibrates itself from a low frequency global clock. After initial tuning, the local clock remains calibr...
95
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
113
Voted
SP
1997
IEEE
15 years 5 months ago
1997
IEEE
When packet filtering is used as a security mechanism, different routers may need to cooperate to enforce the desired security policy. It is difficult to ensure that they will d...
110
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...