2434 search results - page 302 / 487 » Algorithmic Randomness of Closed Sets |
123
click to vote
QEST
2005
IEEE
15 years 9 months ago
2005
IEEE
A framework to assess transient performance measures is introduced by generalizing the theory of the quasi Birthand-Death (QBD) paradigm to QBDs with marked time epochs (QBDm ). T...
152
click to vote
ML
2006
ACM
15 years 3 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
132
Voted
FGR
2011
IEEE
14 years 7 months ago
2011
IEEE
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
152
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
154
click to vote
TALG
2010
14 years 10 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...