10670 search results - page 276 / 2134 » Required Information Release |
194
click to vote
PR
2007
15 years 6 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
216
click to vote
CSFW
2011
IEEE
14 years 7 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
190
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—In order to reduce the long runtimes required to simulate hybrid automatic repeat-request (ARQ) systems, such as high-speed downlink packet access (HSDPA), we propose an informa...
169
click to vote
ICCV
2003
IEEE
16 years 9 months ago
2003
IEEE
In this paper we show that efficient object recognition can be obtained by combining informative features with linear classification. The results demonstrate the superiority of in...
207
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
We discuss the problem of assessing and aiding user performance in dynamic tasks that require rapid selection among multiple information sources. Motivated by research in human se...