Sciweavers

191 search results - page 16 / 39
» Time and area efficient pattern matching on FPGAs
Sort
View
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
15 years 10 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
14 years 11 months ago
Detecting Regular Visit Patterns
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
Bojan Djordjevic, Joachim Gudmundsson, Anh Pham, T...
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
15 years 10 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
ICCV
2001
IEEE
15 years 11 months ago
Stereo Matching by Compact Windows via Minimum Ratio Cycle
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...
Olga Veksler
CONIELECOMP
2005
IEEE
15 years 3 months ago
Approximate Searching on Compressed Text
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
Carlos Avendaño Pérez, Claudia Fereg...