139 search results - page 19 / 28 » Approximations of upper and lower probabilities by measurabl... |
QEST
2008
IEEE
15 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
IJAR
2010
14 years 6 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
98
Voted
WAW
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
106
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we introduce a new approach for partial 3D face recognition, which makes use of shape decomposition over the rigid1 part of a face. To explore the descriptiveness o...