7228 search results - page 328 / 1446 » From Algorithmic to Subjective Randomness |
142
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
148
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
135
click to vote
TACAS
2005
Springer
15 years 10 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
184
click to vote
MP
2011
14 years 12 months ago
2011
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
145
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...