Sciweavers

2996 search results - page 61 / 600
» Numberings and Randomness
Sort
View
CORR
2007
Springer
123views Education» more  CORR 2007»
13 years 10 months ago
On Distributed Computation in Noisy Random Planar Networks
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
Yashodhan Kanoria, D. Manjunath
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 10 months ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
CSDA
2008
108views more  CSDA 2008»
13 years 10 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
FSE
2000
Springer
91views Cryptology» more  FSE 2000»
14 years 1 months ago
A Statistical Attack on RC6
This paper details the attack on RC6 which was announced in a report published in the proceedings of the second AES candidate conference (March 1999). Based on an observation on th...
Henri Gilbert, Helena Handschuh, Antoine Joux, Ser...
RANDOM
1998
Springer
14 years 2 months ago
"Balls into Bins" - A Simple and Tight Analysis
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
Martin Raab, Angelika Steger