962 search results - page 77 / 193 » Efficient Algorithms for Eulerian Extension |
ISMB
2000
15 years 1 months ago
2000
The repetitive structure of genomic DNA holds many secrets to be discovered. A systematic study of repetitive DNA on a genomic or inter-genomic scale requires extensive algorithmi...
NIPS
2000
15 years 1 months ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
JNW
2006
14 years 12 months ago
2006
This paper presents a Distributed Efficient Clustering Approach (DECA) for mobility-resistant and energy-efficient clustering in multi-hop wireless networks. The clusterheads cover...
115
click to vote
COGSR
2011
14 years 6 months ago
2011
Cognitive architectures need to resolve the diversity dilemma – i.e., to blend diversity and simplicity – in order to couple functionality and efficiency with integrability, e...
TC
2008
14 years 11 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...