7228 search results - page 411 / 1446 » From Algorithmic to Subjective Randomness |
194
click to vote
VALUETOOLS
2006
ACM
16 years 21 days ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
147
click to vote
NOSSDAV
2004
Springer
16 years 3 days ago
2004
Springer
Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating serv...
160
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
180
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
196
click to vote
CCS
2010
ACM
15 years 5 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...