2434 search results - page 82 / 487 » Algorithmic Randomness of Closed Sets |
119
Voted
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents' locat...
135
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
115
Voted
IWQOS
2005
Springer
15 years 9 months ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
139
click to vote
SOFSEM
2010
Springer
16 years 9 days ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
151
click to vote
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...