Sciweavers

TC
2008
13 years 4 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
RSA
2006
69views more  RSA 2006»
13 years 4 months ago
On smoothed analysis in dense graphs and formulas
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
RSA
2006
63views more  RSA 2006»
13 years 4 months ago
Random cutting and records in deterministic and random trees
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
Svante Janson
SIGIR
2008
ACM
13 years 4 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
RSA
2006
88views more  RSA 2006»
13 years 4 months ago
Randomly coloring sparse random graphs with fewer colors than the maximum degree
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
DM
2007
83views more  DM 2007»
13 years 4 months ago
Codes identifying sets of vertices in random networks
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
DCG
2007
94views more  DCG 2007»
13 years 4 months ago
Banach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkie...
JCB
2006
124views more  JCB 2006»
13 years 4 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
JC
2006
62views more  JC 2006»
13 years 4 months ago
Random non-cupping revisited
Say that Y has the strong random anticupping property if there is a set A such that for every Martin-L
George Barmpalias
CPC
2007
95views more  CPC 2007»
13 years 4 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald