3208 search results - page 152 / 642 » A Lower Bound for Primality |
150
click to vote
MP
2007
15 years 6 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
175
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
202
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Several object categorization algorithms use kernel methods over multiple cues, as they offer a principled approach to combine multiple cues, and to obtain state-of-theart perform...
156
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
The known secret-sharing schemes for most access structures are not efficient; even for a one-bit secret the length of the shares in the schemes is 2O(n) , where n is the number of...
181
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...