182 search results - page 25 / 37 » A general probabilistic framework for worst case timing anal... |
IJCAI
1989
13 years 8 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
CHARME
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
PAMI
2011
13 years 2 months ago
2011
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...