5356 search results - page 96 / 1072 » Adventures in time and space |
ALGORITHMICA
2008
15 years 1 days ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
72
Voted
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
123
click to vote
STOC
1989
ACM
15 years 4 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
IJBC
2010
14 years 9 months ago
2010
We study returns in dynamical systems: when a set of points, initially populating a prescribed region, swarms around phase space according to a deterministic rule of motion, we sa...