Sciweavers

962 search results - page 77 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
ISMB
2000
15 years 5 months ago
Computation and Visualization of Degenerate Repeats in Complete Genomes
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...
Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher...
NIPS
2000
15 years 5 months ago
The Use of Classifiers in Sequential Inference
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...
Vasin Punyakanok, Dan Roth
JNW
2006
74views more  JNW 2006»
15 years 4 months ago
Mobility Resistant Clustering in Multi-Hop Wireless Networks
This paper presents a Distributed Efficient Clustering Approach (DECA) for mobility-resistant and energy-efficient clustering in multi-hop wireless networks. The clusterheads cover...
Miao Yu, Jason H. Li, Renato Levy
COGSR
2011
102views more  COGSR 2011»
14 years 11 months ago
Rethinking cognitive architecture via graphical models
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...
Paul S. Rosenbloom
TC
2008
15 years 4 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
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 ...
Francisco Rodríguez-Henríquez, Guill...