515 search results - page 81 / 103 » Subsequence Matching on Structured Time Series Data |
SWAT
1994
Springer
14 years 16 days ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
ICCV
1999
IEEE
14 years 23 days ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
ALIFE
1998
13 years 8 months ago
1998
The soil nematode Caenorhabditis Elegans (C. elegans) is the most investigated of all multi-cellular organisms. Since the proposal to use it as a model organism, a series of resea...
NPIV
1999
ACM
14 years 23 days ago
1999
ACM
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...