In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
In this paper, we consider the energy-efficient resource allocation that minimizes a general cost function of average user powers in wireless networks. A class of so-called -fair c...
Xin Wang, Di Wang, Hanqi Zhuang, Salvatore D. Morg...
Background: The prediction of protein structure can be facilitated by the use of constraints based on a knowledge of functional sites. Without this information it is still possibl...
Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering...
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...