Sciweavers

109 search results - page 12 / 22
» Watermarking Graph Partitioning Solutions
Sort
View
ICCAD
1999
IEEE
108views Hardware» more  ICCAD 1999»
15 years 4 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, ...
88
Voted
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
15 years 6 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton
JPDC
2007
177views more  JPDC 2007»
14 years 11 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
121
Voted
JMLR
2010
148views more  JMLR 2010»
14 years 6 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...
PAMI
2010
112views more  PAMI 2010»
14 years 10 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum