5832 search results - page 119 / 1167 » Software complexity and maintainability |
151
click to vote
CC
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
118
click to vote
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
142
click to vote
QOSA
2010
Springer
15 years 5 months ago
2010
Springer
The use of redundant computational nodes is a widely used design tactic to improve the reliability of complex embedded systems. However, this redundancy allocation has also an effe...
171
click to vote
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
114
click to vote
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...