Sciweavers

970 search results - page 67 / 194
» On encodings of spanning trees
Sort
View
PC
2007
123views Management» more  PC 2007»
13 years 8 months ago
MPI collective algorithm selection and quadtree encoding
Abstract. In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. During the algorithm ...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 1 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
13 years 8 months ago
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups
This note deals with a formula due to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symmetric grou...
Stephan G. Wagner
ACL
2006
13 years 10 months ago
A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
Reid Swanson, Andrew S. Gordon
ARSCOM
2005
98views more  ARSCOM 2005»
13 years 8 months ago
Supereulerian planar graphs
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
Hong-Jian Lai, Deying Li, Jingzhong Mao, Mingquan ...