3208 search results - page 328 / 642 » A Lower Bound for Primality |
210
click to vote
NETWORKING
2007
15 years 8 months ago
2007
We re-examine the two reasons for the conservative 1-second Minimum TCP-RTO to protect against spurious timeouts: i) the OS clock granularity and ii) the Delayed ACKs. We find tha...
191
click to vote
NAACL
2004
15 years 8 months ago
2004
Maximum entropy models are a common modeling technique, but prone to overfitting. We show that using an exponential distribution as a prior leads to bounded absolute discounting b...
178
click to vote
NIPS
2001
15 years 8 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
168
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
186
click to vote
CCCG
1998
15 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...