103 search results - page 12 / 21 » The Arithmetical Complexity of Dimension and Randomness |
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
CC
2007
Springer
13 years 8 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
SIROCCO
2010
13 years 10 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
JMLR
2011
13 years 3 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...