Sciweavers

1806 search results - page 99 / 362
» Randomness and halting probabilities
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer
RECOMB
2006
Springer
14 years 9 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 9 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
WAW
2009
Springer
150views Algorithms» more  WAW 2009»
14 years 3 months ago
The Giant Component in a Random Subgraph of a Given Graph
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
Fan Chung Graham, Paul Horn, Linyuan Lu
SEFM
2006
IEEE
14 years 2 months ago
Describing and Executing Random Reactive Systems
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...
Pascal Raymond, Erwan Jahier, Yvan Roux