256 search results - page 21 / 52 » A New Synchronous Lower Bound for Set Agreement |
181
click to vote
FCT
2007
Springer
16 years 10 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
156
click to vote
ISW
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we examine general mechanisms that a covert channel may exploit and derive new minimum requirements for setting up a covert channel. We also propose a new classifica...
146
click to vote
NIPS
2003
15 years 7 months ago
2003
We consider an online learning scenario in which the learner can make predictions on the basis of a fixed set of experts. We derive upper and lower relative loss bounds for a cla...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
145
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...