Sciweavers

351 search results - page 62 / 71
» An exact method for graph coloring
Sort
View
PLDI
2003
ACM
14 years 28 days ago
Static array storage optimization in MATLAB
An adaptation of the classic register allocation algorithm to the problem of array storage optimization in MATLAB is presented. The method involves the decomposition of an interfe...
Pramod G. Joisha, Prithviraj Banerjee
ICCAD
1999
IEEE
108views Hardware» more  ICCAD 1999»
13 years 12 months ago
Copy detection for intellectual property protection of VLSI designs
We give the first study of copy detection techniques for VLSI CAD applications; these techniques are complementary to previous watermarking-based IP protection methods in finding ...
Andrew B. Kahng, Darko Kirovski, Stefanus Mantik, ...
ECOOP
1997
Springer
13 years 11 months ago
Near Optimal Hierarchical Encoding of Types
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
Andreas Krall, Jan Vitek, R. Nigel Horspool
CVPR
2004
IEEE
13 years 11 months ago
Efficient Graphical Models for Processing Images
Graphical models are powerful tools for processing images. However, the large dimensionality of even local image data poses a difficulty: representing the range of possible graphi...
Marshall F. Tappen, Bryan C. Russell, William T. F...
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir