Sciweavers

906 search results - page 68 / 182
» Matching Subsequences in Trees
Sort
View
ICDE
2007
IEEE
123views Database» more  ICDE 2007»
14 years 10 months ago
Stream Monitoring under the Time Warping Distance
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance. Applica...
Yasushi Sakurai, Christos Faloutsos, Masashi Yamam...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 9 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
NBIS
2007
Springer
14 years 3 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
13 years 11 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
CVPR
1998
IEEE
14 years 11 months ago
The Sample Tree: A Sequential Hypothesis Testing Approach to 3D Object Recognition
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
Michael A. Greenspan