2693 search results - page 49 / 539 » On Computing Complex Navigation Functions |
AUSAI
2001
Springer
15 years 2 months ago
2001
Springer
This study attempts to find a theoretical basis for the development of digital cities. The ultimate function of a digital city is to support navigation in an environment. Navigatio...
68
Voted
BMCBI
2010
14 years 10 months ago
2010
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...
STOC
1996
ACM
15 years 1 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
JACM
2000
14 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...