1000 search results - page 117 / 200 » Dependency Tree Automata |
112
Voted
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
107
Voted
COMPUTER
1998
15 years 14 days ago
1998
ER ABSTRACTIONS ter service uses several abstractions— including resource, resource dependencies, and resource groups—to simplify both the cluster service itself and user-visib...
110
click to vote
CIAC
2000
Springer
15 years 5 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
127
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
112
click to vote
JCB
2002
15 years 14 days ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...