Sciweavers

581 search results - page 7 / 117
» An Automata Model for Trees with Ordered Data Values
Sort
View
APLAS
2010
ACM
14 years 9 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
88
Voted
PODS
2008
ACM
143views Database» more  PODS 2008»
15 years 9 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
BDA
2004
14 years 11 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin
DBPL
2007
Springer
98views Database» more  DBPL 2007»
15 years 3 months ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
93
Voted
ICIP
2010
IEEE
14 years 7 months ago
Comparison of merging orders and pruning strategies for Binary Partition Tree in hyperspectral data
Hyperspectral imaging segmentation has been an active research area over the past few years. Despite the growing interest, some factors such as high spectrum variability are still...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...