973 search results - page 72 / 195 » New Bounds on Crossing Numbers |
COLT
2008
Springer
15 years 1 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
JSCIC
2008
14 years 12 months ago
2008
In this paper we present new efficient variants of structured preconditioners for algebraic linear systems arising from the mortar discretization of a degenerate parabolic system o...
ALGORITHMICA
2000
14 years 11 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— We propose a new annealing method for the hyperparameters of several recent Learning Vector Quantization algorithms. We first analyze the relationship between values assigned ...
107
click to vote
ALENEX
2009
15 years 1 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...