Sciweavers

1823 search results - page 77 / 365
» Generating Multiple New Designs From a Sketch
Sort
View
CCS
2010
ACM
13 years 8 months ago
TASTY: tool for automating secure two-party computations
Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the ou...
Wilko Henecka, Stefan Kögl, Ahmad-Reza Sadegh...
IEEEPACT
2006
IEEE
14 years 1 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
MICCAI
2005
Springer
14 years 8 months ago
Shape-Based Averaging for Combination of Multiple Segmentations
Combination of multiple segmentations has recently been introduced as an effective method to obtain segmentations that are more accurate than any of the individual input segmentati...
Torsten Rohlfing, Calvin R. Maurer Jr.
FORTE
2003
13 years 9 months ago
Generation of All Counter-Examples for Push-Down Systems
We present a new, on-the-fly algorithm that given a push-down model representing a sequential program with (recursive) procedure calls and an extended finite-state automaton repr...
Samik Basu, Diptikalyan Saha, Yow-Jian Lin, Scott ...
MTDT
2003
IEEE
105views Hardware» more  MTDT 2003»
14 years 29 days ago
A Testability-Driven Optimizer and Wrapper Generator for Embedded Memories
Memory cores (especially SRAM cores) used on a system chip usually come from a memory compiler. Commercial memory compilers have their limitation— a large memory may need to be ...
Rei-Fu Huang, Li-Ming Denq, Cheng-Wen Wu, Jin-Fu L...