1817 search results - page 336 / 364 » Extensive Games as Process Models |
104
Voted
COLING
1996
15 years 2 months ago
1996
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...
140
Voted
BMCBI
2010
15 years 23 days ago
2010
Background: Natural selection eliminates detrimental and favors advantageous phenotypes. This process leaves characteristic signatures in underlying genomic segments that can be r...
91
Voted
BMCBI
2010
15 years 23 days ago
2010
Background: In the last decade, biochemical studies have revealed that epigenetic modifications including histone modifications, histone variants and DNA methylation form a comple...
108
click to vote
CPHYSICS
2007
15 years 19 days ago
2007
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...
144
Voted
TVLSI
2008
2008
A Design Flow for Architecture Exploration and Implementation of Partially Reconfigurable Processors
15 years 16 days ago
During the last years, the growing application complexity, design, and mask costs have compelled embedded system designers to increasingly consider partially reconfigurable applica...