5580 search results - page 331 / 1116 » Randomized priority algorithms |
184
click to vote
APPROX
2009
Springer
16 years 1 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...
171
click to vote
SEFM
2007
IEEE
16 years 1 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...
148
click to vote
ASIACRYPT
2003
Springer
16 years 5 days 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...
173
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
175
click to vote
AAIM
2006
Springer
16 years 28 days ago
2006
Springer
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...