16430 search results - page 2992 / 3286 » On Computable Tree Functions |
204
click to vote
PAMI
2011
15 years 1 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
191
Voted
TCBB
2011
15 years 1 months ago
2011
—In this paper, we propose a communication model of evolution and investigate its information-theoretic bounds. The process of evolution is modeled as the retransmission of infor...
192
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
198
click to vote
TIT
2011
15 years 1 months ago
2011
— The focus of this paper is on spatial precoding in correlated multi-antenna channels where the number of datastreams is adapted independent of the number of transmit antennas. ...
160
click to vote
TOSN
2011
15 years 1 months ago
2011
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is g...