628 search results - page 87 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
123
click to vote
ICCAD
2008
IEEE
15 years 12 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
136
click to vote
ALENEX
2009
15 years 4 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
147
click to vote
PAKDD
2009
ACM
16 years 7 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
120
click to vote
JACM
2006
15 years 3 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
140
click to vote
STOC
1995
ACM
15 years 6 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...