544 search results - page 15 / 109 » On the Complexity of Loop Fusion |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the t...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
ASAP
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper proposes a novel parallel approach for pipelining of nested multiplexer loops to design high speed decision feedback equalizers (DFEs) based on look-ahead techniques. I...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
IEEEPACT
2007
IEEE
14 years 3 months ago
2007
IEEE
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...