5606 search results - page 718 / 1122 » Randomization Techniques for Graphs. |
239
click to vote
SIGMETRICS
2008
ACM
15 years 6 months ago
2008
ACM
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
172
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
TD-Gammon is a neural network that is able to teach itself to play backgammon solely by playing against itself and learning from the results. Starting from random initial play, TD...
191
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
150
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
We characterize the angular polyspectra, of arbitrary order, associated with isotropic fields defined on the sphere S2 = (x, y, z) : x2 + y2 + z2 = 1 . Our techniques rely heavi...
191
click to vote
PVLDB
2010
15 years 5 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...