Sciweavers

662 search results - page 105 / 133
» Trees, Automata and XML
Sort
View
ENTCS
2002
103views more  ENTCS 2002»
14 years 11 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
LICS
2005
IEEE
15 years 5 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 13 days ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
HICSS
2008
IEEE
119views Biometrics» more  HICSS 2008»
15 years 6 months ago
Tree Mining in Mental Health Domain
The number of mentally ill people is increasing globally each year. Despite major medical advances, the identification of genetic and environmental factors responsible for mental ...
Maja Hadzic, Fedja Hadzic, Tharam S. Dillon
AUSDM
2007
Springer
113views Data Mining» more  AUSDM 2007»
15 years 6 months ago
PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informati...
Sangeetha Kutty, Richi Nayak, Yuefeng Li