Sciweavers

257 search results - page 4 / 52
» Learning Unions of Tree Patterns Using Queries
Sort
View
JALC
2007
95views more  JALC 2007»
13 years 6 months ago
Learning Regular Tree Languages from Correction and Equivalence Queries
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...
Catalin Ionut Tîrnauca, Cristina Tîrna...
SOFSEM
2004
Springer
13 years 11 months ago
Tree Signatures and Unordered XML Pattern Matching
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
ICPR
2008
IEEE
14 years 7 months ago
Learning motion patterns in crowded scenes using motion flow field
Learning typical motion patterns or activities from videos of crowded scenes is an important visual surveillance problem. To detect typical motion patterns in crowded scenarios, w...
Min Hu, Mubarak Shah, Saad Ali
COLT
2001
Springer
13 years 10 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 5 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan