1629 search results - page 160 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
173
click to vote
CODES
2008
IEEE
15 years 8 months ago
2008
IEEE
The performance of system-on-chip is determined not only by the performance of its functional units, but also by how efficiently they cooperate with one another. It is the on-chip...
182
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
163
click to vote
DAC
2006
ACM
16 years 7 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
170
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
157
click to vote
JCB
2007
15 years 6 months ago
2007
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...