Sciweavers

530 search results - page 66 / 106
» Universal randomized switching
Sort
View
ICPR
2006
IEEE
16 years 5 months ago
Illumination Invariant Texture Retrieval
Two fast illumination invariant image retrieval methods for scenes comprising textured objects with variable illumination are introduced. Both methods are based on texture gradien...
Michal Haindl, Pavel Vacha
ICPR
2004
IEEE
16 years 5 months ago
To FRAME or not to FRAME in Probabilistic Texture Modelling?
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
16 years 4 months ago
Non-malleable Obfuscation
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
Ran Canetti, Mayank Varia
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 4 months ago
Learning juntas
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
Elchanan Mossel, Ryan O'Donnell, Rocco A. Servedio
PPDP
2009
Springer
15 years 10 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau