2767 search results - page 279 / 554 » Universal Exponentiation Algorithm |
123
click to vote
RECOMB
2005
Springer
16 years 3 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
152
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
Due to their computational efficiency and strong empirical performance, semidefinite relaxation (SDR)–based algorithms have gained much attention in multiple–input multiple...
113
click to vote
ESTIMEDIA
2009
Springer
15 years 9 months ago
2009
Springer
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
150
click to vote
FM
2009
Springer
15 years 9 months ago
2009
Springer
Abstract: There is growing need to develop formal verification tools for Message Passing Interface (MPI) programs, to eliminate bugs such as deadlocks and local assertion violatio...