Sciweavers

564 search results - page 26 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
BMCBI
2006
239views more  BMCBI 2006»
14 years 9 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
INFOCOM
2000
IEEE
15 years 2 months ago
Distributed Power Control and Spreading Gain Allocation in CDMA Data Networks
We study the radio resource allocation problem of distributed joint transmission power control and spreading gain allocation in a DS-CDMA mobile data network. The network consists...
Seong-Jun Oh, Tava Lennon Olsen, Kimberly M. Wasse...
ASPDAC
1995
ACM
108views Hardware» more  ASPDAC 1995»
15 years 1 months ago
Transistor reordering rules for power reduction in CMOS gates
— The goal of transistor reordering for a logic gate is to reduce the propagation delay as well as the charging and discharging of internal capacitances to achieve low power cons...
Wen-Zen Shen, Jiing-Yuan Lin, Fong-Wen Wang
COCO
2003
Springer
85views Algorithms» more  COCO 2003»
15 years 2 months ago
Universal Languages and the Power of Diagonalization
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
Alan Nash, Russell Impagliazzo, Jeffrey B. Remmel
ECCC
2008
168views more  ECCC 2008»
14 years 9 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson