5153 search results - page 277 / 1031 » Introduction to Randomized Algorithms |
135
Voted
IPCO
2010
15 years 5 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
156
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
134
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
106
click to vote
SEFM
2007
IEEE
15 years 10 months ago
2007
IEEE
Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their per...
114
Voted
ASIACRYPT
2003
Springer
15 years 9 months ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...