1640 search results - page 112 / 328 » Conditional Independence Trees |
136
Voted
WABI
2010
Springer
15 years 1 months ago
2010
Springer
Although many supertree methods have been developed in the last few decades, none has been shown to produce more accurate trees than the popular Matrix Representation with Parsimon...
136
Voted
ISQED
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies multi-core clock distribution using active deskewing methods. We propose an efficient methodology that uses Verilog-A to model PLLs, clock trees and power suppl...
120
click to vote
SODA
2010
ACM
16 years 22 days ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
126
Voted
ESA
1998
Springer
15 years 7 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
134
Voted
COMBINATORICA
2006
15 years 3 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...