Sciweavers

973 search results - page 119 / 195
» New Bounds on Crossing Numbers
Sort
View
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
15 years 6 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
MOC
2000
78views more  MOC 2000»
15 years 6 months ago
Tables of curves with many points
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...
Gerard van der Geer, Marcel van der Vlugt
MOC
2000
76views more  MOC 2000»
15 years 6 months ago
Optimal approximation of stochastic differential equations by adaptive step-size control
We study the pathwise (strong) approximation of scalar stochastic differential equations with respect to the global error in the L2-norm. For equations with additive noise we estab...
Norbert Hofmann, Thomas Müller-Gronbach, Klau...
ML
2007
ACM
131views Machine Learning» more  ML 2007»
15 years 5 months ago
A primal-dual perspective of online learning algorithms
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
MOR
2010
111views more  MOR 2010»
15 years 4 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...