Sciweavers

JDA
2008
100views more  JDA 2008»
13 years 11 months ago
Efficient sampling of random permutations
We show how to uniformly distribute data at random (not to be confounded with permutation routing) in two settings that are able to deal with massive data: coarse grained parallel...
Jens Gustedt
JCB
2008
106views more  JCB 2008»
13 years 11 months ago
Statistics of Random Protein Superpositions: p-Values for Pairwise Structure Alignment
Quantification of statistical significance is essential for the interpretation of protein structural similarity. To address this, a random model for protein structure comparison w...
James O. Wrabl, Nick V. Grishin
IJCV
2006
206views more  IJCV 2006»
13 years 11 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
13 years 11 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
CN
2007
148views more  CN 2007»
13 years 11 months ago
Optimizing random walk search algorithms in P2P networks
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Nabhendra Bisnik, Alhussein A. Abouzeid
CORR
2006
Springer
89views Education» more  CORR 2006»
13 years 11 months ago
Anomalous heat-kernel decay for random walk among bounded random conductances
We consider the nearest-neighbor simple random walk on Zd, d 2, driven by a field of bounded random conductances xy [0, 1]. The conductance law is i.i.d. subject to the condition...
Noam Berger, Marek Biskup, Christopher E. Hoffman,...
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
13 years 11 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
APAL
2006
67views more  APAL 2006»
13 years 11 months ago
On partial randomness
If x = x1x2
Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
13 years 11 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye
DM
2010
97views more  DM 2010»
13 years 11 months ago
Random preorders and alignments
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
Peter J. Cameron, Mihyun Kang, Dudley Stark