Sciweavers

21 search results - page 2 / 5
» Fast Arc-Annotated Subsequence Matching in Linear Space
Sort
View
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
15 years 6 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
PVLDB
2010
103views more  PVLDB 2010»
15 years 11 days ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
CN
2006
124views more  CN 2006»
15 years 2 months ago
Packet classification using diagonal-based tuple space search
Multidimensional packet classification has attracted considerable research interests in the past few years due to the increasing demand on policy based packet forwarding and secur...
Fu-Yuan Lee, Shiuh-Pyng Shieh
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 8 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding
ICCV
2009
IEEE
14 years 11 months ago
An algebraic model for fast corner detection
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
Andrew Willis, Yunfeng Sui