2095 search results - page 326 / 419 » Improved pebbling bounds |
ASPDAC
2006
ACM
14 years 4 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
CONEXT
2006
ACM
14 years 4 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
SI3D
2006
ACM
14 years 4 months ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
SIGMOD
2006
ACM
14 years 4 months ago
2006
ACM
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
3DIM
2005
IEEE
14 years 3 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...