Sciweavers

179 search results - page 3 / 36
» Space Bounded Computations: Review And New Separation Result...
Sort
View
CIARP
2004
Springer
13 years 9 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
COLT
2010
Springer
13 years 3 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
NETWORKS
2008
13 years 5 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
JCB
2008
122views more  JCB 2008»
13 years 5 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
ALT
2006
Springer
14 years 2 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri