827 search results - page 59 / 166 » The Complexity of Probabilistic Lobbying |
138
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
136
click to vote
ICCV
2001
IEEE
16 years 3 months ago
2001
IEEE
This paper describes a framework for learning probabilistic models of objects and scenes and for exploiting these models for tracking complex, deformable, or articulated objects i...
104
click to vote
AIPS
2009
15 years 3 months ago
2009
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
142
click to vote
KR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new family of probabilistic description logics (DLs) that, in contrast to most existing approaches, are derived in a principled way from Halpern’s probabilistic fi...
131
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...