Sciweavers

1631 search results - page 140 / 327
» Uniform Distributed Synthesis
Sort
View
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
15 years 2 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
15 years 2 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
Luc Devroye
RSA
2010
118views more  RSA 2010»
15 years 1 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
VTC
2010
IEEE
128views Communications» more  VTC 2010»
15 years 1 months ago
Performance of Underwater Ad-Hoc Networks
Abstract— We consider the performance of underwater acoustic ad-hoc networks. We assume a uniform distribution of the nodes over a finite area. The node-to-node channel is model...
Andrej Stefanov, Milica Stojanovic
SYMMETRY
2010
90views more  SYMMETRY 2010»
14 years 9 months ago
Orientational Sampling Schemes Based on Four Dimensional Polytopes
Abstract: The vertices of regular four-dimensional polytopes are used to generate sets of uniformly distributed three-dimensional rotations, which are provided as tables of Euler a...
Salvatore Mamone, Giuseppe Pileio, Malcolm H. Levi...