Sciweavers

1414 search results - page 138 / 283
» Randomness and Universal Machines
Sort
View
89
Voted
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
16 years 1 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
91
Voted
STOC
2003
ACM
122views Algorithms» more  STOC 2003»
16 years 29 days 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 7 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
ICPR
2008
IEEE
15 years 7 months ago
Unsupervised mammograms segmentation
We present a multiscale unsupervised segmenter for automatic detection of potentially cancerous regions of interest containing fibroglandular tissue in digital screening mammogra...
Michal Haindl, Stanislav Mikes
86
Voted
ICCCN
2007
IEEE
15 years 7 months ago
Interleaving Techniques for W-CDMA Linear Equalization Receivers
—This paper focuses on the use of specific interleaving techniques for use in W-CDMA (Wideband Code Division Multiple Access). The linear equalization algorithm usually performs ...
João Carlos Silva, Rui Dinis, Nuno Souto, F...