872 search results - page 111 / 175 » Extreme lower probabilities |
104
click to vote
ETT
2002
14 years 11 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
103
click to vote
TASLP
2010
14 years 6 months ago
2010
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
109
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
116
click to vote
ISBI
2008
IEEE
16 years 17 days ago
2008
IEEE
This paper describes a new methodology and associated theoretical analysis for rapid and accurate extraction of activation regions from functional MRI data. Most fMRI data analysi...
214
click to vote
POPL
2003
ACM
16 years 5 days ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...