255 search results - page 27 / 51 » A new upper bound for the bipartite Ramsey problem |
150
click to vote
COCO
2007
Springer
16 years 8 days ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
170
click to vote
RTSS
2006
IEEE
16 years 3 days ago
2006
IEEE
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
178
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
152
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
242
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...