Sciweavers

720 search results - page 61 / 144
» Linear k-arboricities on trees
Sort
View
FGCS
2000
81views more  FGCS 2000»
13 years 8 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ICML
2003
IEEE
14 years 9 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
MOBIHOC
2004
ACM
14 years 2 months ago
Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional ant
Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only energy source to power the nodes. One major metric for energy conservation is to r...
Song Guo, Oliver W. W. Yang
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 1 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
BPM
2008
Springer
155views Business» more  BPM 2008»
13 years 10 months ago
The Refined Process Structure Tree
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
Jussi Vanhatalo, Hagen Völzer, Jana Koehler