Sciweavers

5592 search results - page 11 / 1119
» On Random Betweenness Constraints
Sort
View
TIME
2005
IEEE
14 years 3 months ago
A Local Method for Prioritized Fusion of Temporal Information
Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation which consists in restoring th...
Mahat Khelfallah, Belaid Benhamou
DAM
2010
101views more  DAM 2010»
13 years 10 months ago
On the distribution of distances between specified nodes in increasing trees
We study the quantity distance between node j and node n in a random tree of size n for increasing tree families. We give closed formul
Markus Kuba, Alois Panholzer
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 11 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
COMBINATORICS
2004
69views more  COMBINATORICS 2004»
13 years 9 months ago
Convergence in Distribution for Subset Counts Between Random Sets
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
Dudley Stark
SASO
2008
IEEE
14 years 4 months ago
Wanderer between the Worlds - Self-Organized Network Stability in Attack and Random Failure Scenarios
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
Katharina Anna Zweig, Karin Zimmermann