Sciweavers

285 search results - page 22 / 57
» Power function on stationary classes
Sort
View
CIE
2010
Springer
14 years 11 days ago
How Powerful Are Integer-Valued Martingales?
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...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
GLOBECOM
2009
IEEE
14 years 10 days ago
Fair Energy-Efficient Resource Allocation over Fading TDMA Channels
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...
BMCBI
2008
135views more  BMCBI 2008»
13 years 8 months ago
Functional site prediction selects correct protein models
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...
Vijayalakshmi Chelliah, William R. Taylor
VVS
1998
IEEE
126views Visualization» more  VVS 1998»
14 years 21 days ago
Semi-Automatic Generation of Transfer Functions for Direct Volume Rendering
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...
Gordon L. Kindlmann, James W. Durkin
WWW
2006
ACM
14 years 9 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
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...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das