Sciweavers

13603 search results - page 307 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Time-lagged Directed Information
Directed Information (DI) has recently been introduced to quantify the causality between two signals. However, one major remaining issue with DI is the computational complexity wh...
Ying Liu, Selin Aviyente
ASIACRYPT
2011
Springer
14 years 6 months ago
Biclique Cryptanalysis of the Full AES
Since Rijndael was chosen as the Advanced Encryption Standard, improving upon 7-round attacks on the 128-bit key variant or upon 8-round attacks on the 192/256-bit key variants has...
Andrey Bogdanov, Dmitry Khovratovich, Christian Re...
BROADNETS
2007
IEEE
15 years 11 months ago
Reinforcement learning based routing in all-optical networks with physical impairments
Abstract-- We present and evaluate a reinforcement learningbased RWA algorithm for all-optical networks subject to physical impairments. The technique is suitable for decentralized...
Yvan Pointurier, Fariba Heidari
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 8 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
BMCBI
2010
167views more  BMCBI 2010»
15 years 7 months ago
Creating PWMs of transcription factors using 3D structure-based computation of protein-DNA free binding energies
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
Denitsa Alamanova, Philip Stegmaier, Alexander E. ...