Sciweavers

1279 search results - page 28 / 256
» Fast Implementations of Automata Computations
Sort
View
EMSOFT
2009
Springer
14 years 2 months ago
Analytic real-time analysis and timed automata: a hybrid method for analyzing embedded real-time systems
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...
Kai Lampka, Simon Perathoner, Lothar Thiele
BMCBI
2006
145views more  BMCBI 2006»
13 years 7 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
ISVLSI
2006
IEEE
95views VLSI» more  ISVLSI 2006»
14 years 1 months ago
PLAs in Quantum-dot Cellular Automata
Abstract— Research in the fields of physics, chemistry and electronics has demonstrated that Quantum-dot Cellular Automata (QCA) is a viable alternative for nano-scale computing...
Xiaobo Sharon Hu, Michael Crocker, Michael T. Niem...
SPAA
2006
ACM
14 years 1 months ago
Fault-tolerant semifast implementations of atomic read/write registers
This paper investigates time-efficient implementations of atomic read-write registers in message-passing systems where the number of readers can be unbounded. In particular we st...
Chryssis Georgiou, Nicolas C. Nicolaou, Alexander ...