59 search results - page 4 / 12 » Hardness vs. Randomness within Alternating Time |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
SENSYS
2010
ACM
13 years 5 months ago
2010
ACM
Real-time transit tracking is gaining popularity as a means for transit agencies to improve the rider experience. However, many transit agencies lack either the funding or initiat...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...