356 search results - page 28 / 72 » Parallelizing time with polynomial circuits |
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
TCS
2008
14 years 11 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
111
click to vote
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Recent advances in FPGA technologies allow to configure the RAM-based FPGA devices in a reduced time as an effective support for real-time applications. The physical dimensions of ...
ICPP
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
DAC
2001
ACM
16 years 22 days ago
2001
ACM
In this paper, we study the problem of performance-driven multi-level circuit clustering with application to hierarchical FPGA designs. We first show that the performance-driven m...