Sciweavers

1817 search results - page 336 / 364
» Extensive Games as Process Models
Sort
View
COLING
1996
13 years 12 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
BMCBI
2010
125views more  BMCBI 2010»
13 years 10 months ago
Haplotype allelic classes for detecting ongoing positive selection
Background: Natural selection eliminates detrimental and favors advantageous phenotypes. This process leaves characteristic signatures in underlying genomic segments that can be r...
Julie Hussin, Philippe Nadeau, Jean-Françoi...
BMCBI
2010
109views more  BMCBI 2010»
13 years 10 months ago
Application of machine learning methods to histone methylation ChIP-Seq data reveals H4R3me2 globally represses gene expression
Background: In the last decade, biochemical studies have revealed that epigenetic modifications including histone modifications, histone variants and DNA methylation form a comple...
Xiaojiang Xu, Stephen Hoang, Marty W. Mayo, Stefan...
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 10 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
TVLSI
2008
187views more  TVLSI 2008»
13 years 10 months ago
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...
Kingshuk Karuri, Anupam Chattopadhyay, Xiaolin Che...