Sciweavers

2168 search results - page 289 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 7 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
119
Voted
VTS
1995
IEEE
94views Hardware» more  VTS 1995»
15 years 7 months ago
Synthesis of locally exhaustive test pattern generators
Optimized locally exhaustive test pattern generators based on linear sums promise a low overhead, but have an irregular structure. The paper presents a new algorithm able to compu...
Günter Kemnitz
135
Voted
VLDB
1991
ACM
134views Database» more  VLDB 1991»
15 years 7 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
EVOW
2008
Springer
15 years 5 months ago
Evolving an Automatic Defect Classification Tool
Automatic Defect Classification (ADC) is a well-developed technology for inspection and measurement of defects on patterned wafers in the semiconductors industry. The poor training...
Assaf Glazer, Moshe Sipper
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 26 days ago
The Stability of Low-Rank Matrix Reconstruction: a Constrained Singular Value View
The stability of low-rank matrix reconstruction is investigated in this paper. The -constrained minimal singular value ( -CMSV) of the measurement operator is shown to determine t...
Gongguo Tang, Arye Nehorai