Sciweavers

1640 search results - page 64 / 328
» Conditional Independence Trees
Sort
View
ECWEB
2003
Springer
110views ECommerce» more  ECWEB 2003»
15 years 7 months ago
Transformation of XML Data Using an Unranked Tree Transducer
Transformation of data documents is of special importance to use XML as the universal data interchange format on the Web. Data transformation is used in many tasks that require dat...
Tadeusz Pankowski
112
Voted
EJC
2000
15 years 3 months ago
A Communicating Tree Model for Generating Network Applications
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
Tomohiro Matsuzaki, Takehiro Tokuda
103
Voted
ACIVS
2008
Springer
15 years 9 months ago
Parallel Algorithm for Concurrent Computation of Connected Component Tree
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
P. Matas, Eva Dokladalova, Mohamed Akil, Thierry G...
118
Voted
TABLEAUX
2007
Springer
15 years 8 months ago
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
Ryo Ishigaki, Kentaro Kikuchi
133
Voted
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
15 years 7 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf