Sciweavers

RSA
2010
89views more  RSA 2010»
13 years 3 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
MICS
2010
134views more  MICS 2010»
13 years 3 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
ISCI
2010
118views more  ISCI 2010»
13 years 3 months ago
Approximations of upper and lower probabilities by measurable selections
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
Enrique Miranda, Inés Couso, Pedro Gil
INFOCOM
2010
IEEE
13 years 3 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
ICST
2010
IEEE
13 years 3 months ago
Satisfying Test Preconditions through Guided Object Selection
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
Yi Wei, Serge Gebhardt, Bertrand Meyer, Manuel Ori...
SAC
2008
ACM
13 years 4 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
RSA
2008
94views more  RSA 2008»
13 years 4 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
RSA
2008
94views more  RSA 2008»
13 years 4 months ago
The cycle structure of two rows in a random Latin square
Let L be chosen uniformly at random from among the latin squares of order n 4 and let r, s be arbitrary distinct rows of L. We study the distribution of r,s, the permutation of t...
Nicholas J. Cavenagh, Catherine S. Greenhill, Ian ...
RSA
2008
78views more  RSA 2008»
13 years 4 months ago
How many random edges make a dense hypergraph non-2-colorable?
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
Benny Sudakov, Jan Vondrák
TCS
2002
13 years 4 months ago
A characterization of c.e. random reals
A real is computably enumerable if it is the limit of a computable, increasing, converging sequence of rationals. A real is random if its binary expansion is a random sequence. Ou...
Cristian Calude