Sciweavers

4542 search results - page 390 / 909
» Design patterns for data structures
Sort
View
ICDE
2002
IEEE
140views Database» more  ICDE 2002»
16 years 8 months ago
Efficient Filtering of XML Documents with XPath Expressions
We propose a novel index structure, termed XTrie, that supports the efficient filtering of XML documents based on XPath expressions. Our XTrie index structure offers several novel...
Chee Yong Chan, Pascal Felber, Minos N. Garofalaki...
CVPR
2010
IEEE
16 years 3 months ago
Unified Graph Matching in Euclidean Spaces
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
WIRN
2005
Springer
16 years 9 days ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
CIKM
1998
Springer
15 years 11 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
TODS
2002
92views more  TODS 2002»
15 years 6 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella