1998 search results - page 316 / 400 » Complexity of the Cover Polynomial |
92
Voted
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
115
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
100
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
118
Voted
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
99
Voted
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...