Sciweavers

564 search results - page 8 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
14 years 9 months ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
DC
2010
14 years 7 months ago
A taxonomy of process calculi for distribution and mobility
In this paper, we comparatively analyze some mainstream calculi for mobility and distribution, together with some of their variants: asynchronous -calculus, distributed -calculus,...
Daniele Gorla
BMCBI
2010
193views more  BMCBI 2010»
14 years 4 months ago
Mayday - integrative analytics for expression data
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...
Florian Battke, Stephan Symons, Kay Nieselt
BMCBI
2006
99views more  BMCBI 2006»
14 years 9 months ago
A proposed metric for assessing the measurement quality of individual microarrays
Background: High-density microarray technology is increasingly applied to study gene expression levels on a large scale. Microarray experiments rely on several critical steps that...
Kyoungmi Kim, Grier P. Page, T. Mark Beasley, Step...
ATAL
2010
Springer
14 years 9 months ago
Verifying agents with memory is harder than it seemed
ATL+ is a variant of alternating-time temporal logic that does not have the expressive power of full ATL , but still allows for expressing some natural properties of agents. It ha...
Nils Bulling, Wojciech Jamroga