Sciweavers

257 search results - page 11 / 52
» Learning Unions of Tree Patterns Using Queries
Sort
View
DOCENG
2003
ACM
15 years 2 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
ACCV
2010
Springer
14 years 4 months ago
Face Recognition with Decision Tree-Based Local Binary Patterns
Many state-of-the-art face recognition algorithms use image descriptors based on features known as Local Binary Patterns (LBPs). While many variations of LBP exist, so far none of ...
Daniel Maturana, Domingo Mery, Alvaro Soto
PEPM
2007
ACM
15 years 3 months ago
Behavioral similarity matching using concrete source code templates in logic queries
Program query languages and pattern-detection techniques are an essential part of program analysis and manipulation systems. Queries and patterns permit the identification of the...
Coen De Roover, Theo D'Hondt, Johan Brichau, Carlo...
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 4 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
EDBT
2006
ACM
130views Database» more  EDBT 2006»
15 years 9 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart