Sciweavers

516 search results - page 61 / 104
» Sets of k-Independent Strings
Sort
View
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 1 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
EUROCRYPT
2001
Springer
14 years 1 months ago
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
Yevgeniy Dodis, Amit Sahai, Adam Smith
CORR
1999
Springer
93views Education» more  CORR 1999»
13 years 8 months ago
On the Power of Positive Turing Reductions
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
Edith Hemaspaandra

Book
695views
15 years 4 months ago
The Scheme Programming Language
"Scheme is a general-purpose computer programming language. It is a high-level language, supporting operations on structured data such as strings, lists, and vectors, as well ...
R. Kent Dybvig
ICIP
2002
IEEE
14 years 10 months ago
Robust video text segmentation and recognition with multiple hypotheses
A method for segmenting and recognizing text embedded in video and images is proposed in this paper. In the method, multiple segmentation of the same text region is performed, thu...
Jean-Marc Odobez, Datong Chen