Sciweavers

4103 search results - page 603 / 821
» Some results on the Collatz problem
Sort
View
IPPS
2009
IEEE
16 years 1 months ago
An upload bandwidth threshold for peer-to-peer Video-on-Demand scalability
We consider the fully distributed Video-on-Demand problem, where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less between ...
Yacine Boufkhad, Fabien Mathieu, Fabien de Montgol...
OOPSLA
2007
Springer
16 years 18 days ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
ECRTS
2006
IEEE
16 years 15 days ago
WCET-Centric Software-controlled Instruction Caches for Hard Real-Time Systems
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
Isabelle Puaut
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
16 years 3 hour ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin