1421 search results - page 114 / 285 » Algorithms for subsequence combinatorics |
143
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
132
click to vote
CASC
2009
Springer
15 years 11 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
125
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we present a novel data hiding scheme based on the minimum distortion look-up table (LUT) embedding that achieves good distortion-robustness performance. We first ...
126
click to vote
IPMU
2010
Springer
15 years 8 months ago
2010
Springer
This article proposes knowledge-based short-time prediction methods for multivariate streaming time series, relying on the early recognition of local patterns. A parametric, well-i...
134
click to vote
NIPS
2001
15 years 5 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...