Sciweavers

3428 search results - page 566 / 686
» Making the Case
Sort
View
SOSP
2005
ACM
16 years 3 months ago
Capturing, indexing, clustering, and retrieving system history
We present a method for automatically extracting from a running system an indexable signature that distills the essential characteristic from a system state and that can be subjec...
Ira Cohen, Steve Zhang, Moisés Goldszmidt, ...
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
16 years 3 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
CVPR
2010
IEEE
16 years 2 months ago
Improving State-of-the-Art OCR through High-Precision Document-Specific Modeling
Optical character recognition (OCR) remains a difficult problem for noisy documents or documents not scanned at high resolution. Many current approaches rely on stored font models...
Andrew Kae, Gary Huang, Erik Learned-miller, Carl ...
TACAS
2010
Springer
145views Algorithms» more  TACAS 2010»
16 years 1 months ago
Rational Synthesis
Abstract. Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems oft...
Dana Fisman, Orna Kupferman, Yoad Lustig
STACS
2010
Springer
16 years 1 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen