4843 search results - page 354 / 969 » The Shortcut Problem - Complexity and Approximation |
115
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
The sequence kernel has been shown to be a promising kernel function for learning from sequential data such as speech and DNA. However, it is not scalable to massive datasets due ...
129
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
126
click to vote
EOR
2006
15 years 4 months ago
2006
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
136
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
157
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...