2957 search results - page 18 / 592 » The Complexity of Polynomial-Time Approximation |
143
click to vote
COCO
2006
Springer
15 years 6 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
111
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
142
click to vote
STOC
2000
ACM
15 years 7 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
164
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
124
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...