Sciweavers

621 search results - page 5 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 8 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
COLT
2010
Springer
13 years 6 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
FCT
2001
Springer
14 years 19 days ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
JACIII
2006
33views more  JACIII 2006»
13 years 8 months ago
Efficient Processing of XML Tree Pattern Queries
Yangjun Chen, Dunren Che
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
14 years 1 months ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee