Sciweavers

587 search results - page 92 / 118
» Theory of matching pursuit
Sort
View
CSB
2004
IEEE
113views Bioinformatics» more  CSB 2004»
14 years 5 days ago
Shannon Information in Complete Genomes
Shannon information in the genomes of all completely sequenced prokaryotes and eukaryotes are measured in word lengths of two to ten letters. It is found that in a scale-dependent...
Chang-Heng Chang, Li-Ching Hsieh, Ta-Yuan Chen, Ho...
EMSOFT
2006
Springer
14 years 3 days ago
Scheduling-independent threads and exceptions in SHIM
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...
Olivier Tardieu, Stephen A. Edwards
ICSE
1997
IEEE-ACM
14 years 34 min ago
Introducing Formal Specification Methods in Industrial Practice
Formal specification methods are not often applied in industrial projects, despite their advantages and the maturity of theories and tools. The scarce familiarity of practitioners...
Luciano Baresi, Alessandro Orso, Mauro Pezzè...
LICS
1997
IEEE
13 years 12 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
PODC
1991
ACM
13 years 12 months ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are deļ¬ned and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
Shlomi Dolev, Amos Israeli, Shlomo Moran