2542 search results - page 179 / 509 » Computing Cartograms with Optimal Complexity |
132
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
140
click to vote
TMC
2011
14 years 10 months ago
2011
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
138
Voted
KDD
2007
ACM
16 years 3 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
139
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract—We analyze the performance limits of data dissemination with multi-channel, single radio sensors. We formulate the problem of minimizing the average delay of data dissem...
127
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...