2297 search results - page 11 / 460 » An Algorithm for Computing the Integral Closure |
JAR
1998
13 years 8 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
Achieving design closure is one of the biggest headaches for modern VLSI designers. This problem is exacerbated by high-level design automation tools that ignore increasingly impo...
ISPD
2010
ACM
14 years 3 months ago
2010
ACM
Timing-driven placement is a critical step in nanometerscale physical synthesis. To improve design timing on a global scale, net-weight based global timing-driven placement is a c...
ICCV
1999
IEEE
14 years 10 months ago
1999
IEEE
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
BC
2005
13 years 8 months ago
2005
Abstract Weproposeacomputationalmodelofcontourintegration for visual saliency. The model uses biologically plausible devices to simulate how the representations of elements aligned...