2612 search results - page 183 / 523 » Switching Graphs and Their Complexity |
127
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
115
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper, we focus on finding complex annotation patterns representing novel and interesting hypotheses from gene annotation data. We define a generalization of th...
142
Voted
HPDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
161
click to vote
SC
2009
ACM
15 years 9 months ago
2009
ACM
In order to understand the complex physics of mother nature, physicist often use many approximations to understand one area of physics and then write a simulation to reduce these ...
127
click to vote
CN
2008
15 years 4 months ago
2008
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...