2354 search results - page 74 / 471 » Radio number for trees |
189
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...
185
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
157
click to vote
AIML
2006
15 years 7 months ago
2006
We survey a number of decidablity and undecidablity results concerning epistemic temporal logic. The goal is to provide a general picture which will facilitate the `sharing of idea...
148
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
121
click to vote
IPL
2006
15 years 6 months ago
2006
We present an algorithm to find a proper fraction in simplest reduced terms between two reduced proper fractions. A proper fraction is a rational number m/n with