Sciweavers

834 search results - page 91 / 167
» Quantifying and Measuring Anonymity
Sort
View
TPDS
1998
108views more  TPDS 1998»
13 years 9 months ago
Critical Path Profiling of Message Passing and Shared-Memory Programs
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
Jeffrey K. Hollingsworth
ICIP
2009
IEEE
13 years 7 months ago
Main subject detection via adaptive feature selection
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
Cuong T. Vu, Damon M. Chandler
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
Fundamental Rate-Reliability-Complexity Limits in Outage Limited MIMO Communications
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
Petros Elia, Joakim Jalden
ICASSP
2011
IEEE
13 years 1 months ago
Assessing the speaker recognition performance of naive listeners using mechanical turk
In this paper we attempt to quantify the ability of naive listeners to perform speaker recognition in the context of the NIST evaluation task. We describe our protocol: a series o...
Wade Shen, Joseph P. Campbell, Derek Straub, Reva ...
ICASSP
2011
IEEE
13 years 1 months ago
Robust Bayesian Analysis applied to Wiener filtering of speech
Commonly used speech enhancement algorithms estimate the power spectral density of the noise to be removed, or make a decision about the presence of speech in a particular frame, ...
Phil Spencer Whitehead, David V. Anderson