284 search results - page 32 / 57 » Linear Time Algorithms for Generalized Edge Dominating Set P... |
132
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
133
Voted
UAI
2008
15 years 3 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
120
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
114
Voted
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
115
Voted
DAC
2005
ACM
15 years 4 months ago
2005
ACM
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...