61 search results - page 4 / 13 » Pointed binary encompassing trees: Simple and optimal |
93
Voted
BIBE
2006
IEEE
15 years 3 months ago
2006
IEEE
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
93
Voted
ANOR
2011
14 years 1 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
73
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
162
click to vote
Publication
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the ...