473 search results - page 31 / 95 » Heapable Sequences and Subsequences |
161
Voted
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we demonstrate that the performance of a motif discovery algorithm can be significantly improved by embedding it into a novel framework that effectively guides the ...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
64
Voted
ICPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Textural appearance of many real word materials is not static but shows progress in time. If such a progress is spatially and temporally homogeneous these materials can be represe...
ACCV
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents a practical method for hypothesizing hand locations and subsequently recognizing a discrete number of poses in image sequences. In a typical setting the user is...