128 search results - page 1 / 26 » Lower bounds for adaptive collect and related objects |
PODC
2004
ACM
13 years 10 months ago
2004
ACM
WDAG
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents lower bounds on the time- and space-complexity of implementations that use the k compare-and-swap (k-CAS) synchronization primitives. We prove that the use of ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
JCO
2010
13 years 3 months ago
2010
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...