2069 search results - page 34 / 414 » Linear time algorithms for Clobber |
151
click to vote
CPM
2004
Springer
15 years 9 months ago
2004
Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
125
Voted
RTAS
2010
IEEE
15 years 1 months ago
2010
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
151
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
104
click to vote
ICCAD
2006
IEEE
16 years 20 days ago
2006
IEEE
— In this paper, we propose a timing model reduction algorithm for hierarchical timing analysis based on a bicliquestar replacement technique. In hierarchical timing analysis, ea...
128
Voted
JSC
2010
15 years 2 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...