Sciweavers

1369 search results - page 103 / 274
» Lattice computations for random numbers
Sort
View
INFOCOM
2009
IEEE
16 years 11 days ago
Exact Analysis of Latency of Stateless Opportunistic Forwarding
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
Chi-Kin Chau, Prithwish Basu
IWCMC
2006
ACM
15 years 11 months ago
Queuing network models for delay analysis of multihop wireless ad hoc networks
— In this paper we focus on characterizing the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with station...
Nabhendra Bisnik, Alhussein A. Abouzeid
ICALP
2004
Springer
15 years 11 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
16 years 2 days ago
Semiblind Carrier Frequency Offset Estimation for OFDM Systems
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...
Tilde Fusco, Ferdinando Marrone, Mario Tanda
RANDOM
2001
Springer
15 years 10 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky