Sciweavers

6142 search results - page 332 / 1229
» The Complexity of Partition Functions
Sort
View
TCC
2010
Springer
175views Cryptology» more  TCC 2010»
15 years 5 months ago
Obfuscation of Hyperplane Membership
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
Ran Canetti, Guy N. Rothblum, Mayank Varia

Book
376views
17 years 4 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
ISW
2009
Springer
16 years 1 months ago
On Free-Start Collisions and Collisions for TIB3
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
Florian Mendel, Martin Schläffer
RANDOM
2001
Springer
15 years 11 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
ICIP
1999
IEEE
16 years 8 months ago
A Proposal for Dependent Optimization in Scalable Region-Based Coding Systems
We address in this paper the problem of optimal coding in the framework of region-based video coding systems, with a special stress on content-based functionalities. We present a ...
Ferran Marqués, Josep Ramon Morros