Sciweavers

949 search results - page 27 / 190
» exact 2008
Sort
View
JCT
2008
138views more  JCT 2008»
15 years 13 days ago
There exists no Steiner system S(4, 5, 17)
If a Steiner system S(4, 5, 17) exists, it would contain derived S(3, 4, 16) designs. By relying on a recent classification of the S(3, 4, 16), an exhaustive computer search for S...
Patric R. J. Östergård, Olli Pottonen
77
Voted
IPL
2008
95views more  IPL 2008»
15 years 13 days ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
UAI
2008
15 years 1 months ago
The Computational Complexity of Sensitivity Analysis and Parameter Tuning
While known algorithms for sensitivity analysis and parameter tuning in probabilistic networks have a running time that is exponential in the size of the network, the exact comput...
Johan Kwisthout, Linda C. van der Gaag
100
Voted
NECO
2008
112views more  NECO 2008»
15 years 12 days ago
Second-Order SMO Improves SVM Online and Active Learning
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
Tobias Glasmachers, Christian Igel
ENDM
2008
81views more  ENDM 2008»
15 years 16 days ago
The maximum number of halving lines and the rectilinear crossing number of Kn for n
For n 27 we present exact values for the maximum number h(n) of halving lines and h(n) of halving pseudolines, determined by n points in the plane. For this range of values of n ...
Bernardo M. Ábrego, Silvia Fernández...