1798 search results - page 83 / 360 » A Tree for All Seasons |
199
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
174
click to vote
JCB
2002
15 years 6 months 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...
151
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
157
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
154
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...