5100 search results - page 745 / 1020 » The Linear Complexity of a Graph |
158
click to vote
RECOMB
2009
Springer
16 years 7 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
174
click to vote
HPCA
2001
IEEE
16 years 7 months ago
2001
IEEE
This paper presents a new method for branch prediction. The key idea is to use one of the simplest possible neural networks, the perceptron as an alternative to the commonly used ...
143
click to vote
ICCD
2008
IEEE
16 years 3 months ago
2008
IEEE
— Circuit and processor designs will continue to increase in complexity for the foreseeable future. With these increasing sizes comes the use of wide buses to move large amounts ...
202
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
159
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We address the problem of foothold selection in robotic legged locomotion over very rough terrain. The difficulty of the problem we address here is comparable to that of human...