Sciweavers

932 search results - page 173 / 187
» Uniform Random Number Generators
Sort
View
LATINCRYPT
2010
14 years 8 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
SYNTHESE
2010
99views more  SYNTHESE 2010»
14 years 4 months ago
The epistemology of science - a bird's-eye view
In this paper I outline my conception of the epistemology of science, by reference to my published papers, showing how the ideas presented there fit together. In particular I disc...
Alexander Bird
CVPR
2004
IEEE
15 years 11 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
IPPS
2003
IEEE
15 years 3 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 1 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam