520 search results - page 36 / 104 » Subset Counting in Trees |
ICDE
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract— There are many applications in which users interactively access huge tree data by repeating set-based navigations. In this paper, we focus on label-specific/wildcard c...
NJC
2006
13 years 7 months ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we propose a tree-structured multiclass classifier to identify annotations and overlapping text from machine printed documents. Each node of the tree-structured cla...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
JDCTA
2010
13 years 2 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...