Sciweavers

42230 search results - page 342 / 8446
» Algorithms and Complexity Results for
Sort
View
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
ICASSP
2010
IEEE
15 years 5 months ago
Adaptive beam tracking for interference alignment for multiuser time-varying MIMO interference channels
The problem of interference alignment in time-varying MIMO interference channels is considered. To reduce complexity, an adaptive algorithm for beam vector design is proposed base...
Heejung Yu, Youngchul Sung, Haksoo Kim, Yong Hoon ...
BMCBI
2010
105views more  BMCBI 2010»
15 years 6 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 10 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
PODS
2006
ACM
98views Database» more  PODS 2006»
16 years 6 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch