Sciweavers

187 search results - page 15 / 38
» Labeling Schemes for Tree Representation
Sort
View
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 9 months ago
Designing and Evaluating an XPath Dialect for Linguistic Queries
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
Steven Bird, Yi Chen, Susan B. Davidson, Haejoong ...
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
IBPRIA
2011
Springer
12 years 11 months ago
Classifying Melodies Using Tree Grammars
Abstract. Similarity computation is a difficult issue in music information retrieval, because it tries to emulate the special ability that humans show for pattern recognition in ge...
José Francisco Bernabeu, Jorge Calera-Rubio...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 6 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...