Sciweavers

3240 search results - page 120 / 648
» Pre-aggregation with probability distributions
Sort
View
INFOCOM
2007
IEEE
14 years 4 months ago
Service Time Approximation in IEEE 802.11 Single-Hop Ad-hoc Networks
Abstract— This paper investigates the near-memoryless behavior of the service time for IEEE 802.11 saturated single-hop ad hoc networks. We show that the number of packets succes...
Atef Abdrabou, Weihua Zhuang
EVOW
2004
Springer
14 years 3 months ago
On the Structure of Sequential Search: Beyond "No Free Lunch"
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
Thomas M. English
ALT
2010
Springer
13 years 7 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
TWC
2008
135views more  TWC 2008»
13 years 10 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
ALENEX
2004
92views Algorithms» more  ALENEX 2004»
13 years 11 months ago
Gap-Free Samples of Geometric Random Variables
We study the asymptotic probability that a random composition of an integer n is gap-free, that is, that the sizes of parts in the composition form an interval. We show that this ...
Pawel Hitczenko, Arnold Knopfmacher