720 search results - page 52 / 144 » Linear k-arboricities on trees |
171
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
184
click to vote
ISMB
1994
15 years 7 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
196
click to vote
DATAMINE
1999
15 years 6 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
205
click to vote
SPAA
1999
ACM
15 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
191
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...