10412 search results - page 1651 / 2083 » The efficiency of algorithms - misconceptions |
193
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
208
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
200
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
167
click to vote
ICNP
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we present a new approach for the automated mapping of formal descriptions into activity thread implementations. Our approach resolves semantic conflicts by reorderi...
240
click to vote
FPGA
1999
ACM
15 years 11 months ago
1999
ACM
Pipelining of data path structures increases the throughput rate at the expense of enlarged resource usage and latency unless architectures optimized towards specific applications...