Sciweavers

5592 search results - page 119 / 1119
» On Random Betweenness Constraints
Sort
View
PDP
2006
IEEE
14 years 4 months ago
A Distributed Query Structure to Explore Random Mappings in Parallel
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...
Jan Heichler, Jorg Keller
WIOPT
2006
IEEE
14 years 4 months ago
A structural property of solutions to path optimization problems in random access networks
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...
CPC
2011
189views Education» more  CPC 2011»
13 years 5 months ago
A Counter-Intuitive Correlation in a Random Tournament
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
Sven Erick Alm, Svante Linusson
FOCS
2003
IEEE
14 years 3 months ago
On Certain Connectivity Properties of the Internet Topology
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
Milena Mihail, Christos H. Papadimitriou, Amin Sab...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 5 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand