1060 search results - page 106 / 212 » On the Discovery of Random Trees |
153
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
192
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...
170
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
190
click to vote
JIRS
2010
15 years 4 months ago
2010
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
204
click to vote
BMCBI
2011
15 years 26 days ago
2011
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...