973 search results - page 52 / 195 » New Bounds on Crossing Numbers |
107
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
113
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
ALT
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
STOC
2005
ACM
15 years 5 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...