Sciweavers

2479 search results - page 103 / 496
» Random Event Structures
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 6 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
INFOCOM
2007
IEEE
14 years 3 months ago
Multiple-Choice Random Network for Server Load Balancing
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
Ye Xia, Alin Dobra, Seung Chul Han
CPC
1998
123views more  CPC 1998»
13 years 8 months ago
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
Michael Molloy, Bruce A. Reed
COMGEO
1999
ACM
13 years 8 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
ICFEM
2000
Springer
14 years 16 days ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton