Sciweavers

2877 search results - page 168 / 576
» The Complexity of Planarity Testing
Sort
View
ICCD
1992
IEEE
83views Hardware» more  ICCD 1992»
15 years 11 months ago
Logical Verification of the NVAX CPU Chip Design
ct Digital's NVAX high-performance microprocessor has a complex logical design. A rigorous simulation-based verification effort was undertaken to ensure that there were no log...
Walker Anderson
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
15 years 5 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia
CVPR
1997
IEEE
16 years 9 months ago
Representation Of Objects In A Volumetric Frequency Domain With Application To Face Recognition
A novel method for representing 3-D objects that unifies viewer and model centered object representations is presented. A unified 3-D frequency-domain representation (called Volum...
Jezekiel Ben-Arie, Dibyendu Nandy
ECCV
1998
Springer
16 years 9 months ago
Projective and Illumination Invariant Representation of Disjoint Shapes
We describe a new projectively invariant representation of disjoint contour groups which is suitable for shape-based retrieval from an image database. It consists of simultaneous ...
Sergei Startchik, Ruggero Milanese, Thierry Pun
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 7 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata