81 search results - page 5 / 17 » Properties of Random Triangulations and Trees |
161
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
173
click to vote
CTRSA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
246
Voted
EUROGP
2010
Springer
16 years 1 months ago
2010
Springer
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
242
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...