Sciweavers

5606 search results - page 336 / 1122
» Randomization Techniques for Graphs.
Sort
View
ECCC
2000
140views more  ECCC 2000»
15 years 6 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
IJCV
2008
157views more  IJCV 2008»
15 years 6 months ago
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
Systems utilizing multiple sensors are required in many domains. In this paper, we specifically concern ourselves with applications where dynamic objects appear randomly and the s...
Anurag Mittal, Larry S. Davis
WWW
2006
ACM
16 years 7 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
VTC
2007
IEEE
105views Communications» more  VTC 2007»
16 years 26 days ago
Random Beamforming OFDMA for Future Generation Cellular Communication Systems
—This paper presents a downlink performance analysis of a Layered Random Beamforming (LRB) - MIMO-OFDMA Physical Layer (PHY) as applicable to future generation wireless communica...
Congzheng Han, Angela Doufexi, Simon Armour, Joe M...
157
Voted
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
16 years 9 hour 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