Sciweavers

Share
843 search results - page 1 / 169
» Descendants in Increasing Trees
Sort
View
COMBINATORICS
2006
129views more  COMBINATORICS 2006»
9 years 9 months ago
Descendants in Increasing Trees
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
Markus Kuba, Alois Panholzer
TCS
2010
9 years 8 months ago
A combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Markus Kuba, Alois Panholzer
EMNLP
2007
9 years 11 months ago
Japanese Dependency Analysis Using the Ancestor-Descendant Relation
We propose a novel method for Japanese dependency analysis, which is usually reduced to the construction of a dependency tree. In deterministic approaches to this task, dependency...
Akihiro Tamura, Hiroya Takamura, Manabu Okumura
CCCG
2006
9 years 11 months ago
Shortest Descending Paths through Given Faces
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw
AAAI
2010
9 years 11 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
books