Sciweavers

973 search results - page 10 / 195
» New Bounds on Crossing Numbers
Sort
View
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
COMPGEOM
1996
ACM
13 years 11 months ago
On the Number of Arrangements of Pseudolines
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
Stefan Felsner
COMBINATORICS
2000
87views more  COMBINATORICS 2000»
13 years 7 months ago
Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
Harold Fredricksen, Melvin M. Sweet
COLT
1999
Springer
13 years 11 months ago
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...
Avrim Blum, Adam Kalai, John Langford
IWCMC
2006
ACM
14 years 1 months ago
Bounds on the fading number of multiple-input single-output fading channels with memory
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
Stefan M. Moser