Sciweavers

849 search results - page 9 / 170
» Completely Non-malleable Schemes
Sort
View
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
14 years 28 days ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
14 years 1 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton
DAS
2008
Springer
13 years 9 months ago
A Complete Optical Character Recognition Methodology for Historical Documents
In this paper a complete OCR methodology for recognizing historical documents, either printed or handwritten without any knowledge of the font, is presented. This methodology cons...
Georgios Vamvakas, Basilios Gatos, Nikolaos Stamat...
CVPR
2010
IEEE
14 years 4 months ago
Robust video denoising using low rank matrix completion
Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, ...
Hui Ji, Chaoqiang Liu, Zuowei Shen, Yuhong Xu
ECCV
2010
Springer
13 years 11 months ago
Exploiting Repetitive Object Patterns for Model Compression and Completion
Many man-made and natural structures consist of similar elements arranged in regular patterns. In this paper we present an unsupervised approach for discovering and reasoning on re...