255 search results - page 13 / 51 » A new upper bound for the bipartite Ramsey problem |
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
CN
2007
14 years 11 months ago
2007
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
114
click to vote
STOC
2005
ACM
16 years 14 hour ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
CPM
2000
Springer
15 years 3 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
107
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...