400 search results - page 52 / 80 » Lower Bounds Using Kolmogorov Complexity |
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...
CCECE
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
VVS
1996
IEEE
14 years 28 days ago
1996
IEEE
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...
PODS
1993
ACM
14 years 26 days ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...