827 search results - page 11 / 166 » The Complexity of Probabilistic Lobbying |
126
click to vote
CMSB
2010
Springer
14 years 8 months ago
2010
Springer
Boolean modeling frameworks have long since proved their worth for capturing and analyzing essential characteristics of complex systems. Hybrid approaches aim at exploiting the ad...
148
click to vote
PAMI
2011
14 years 4 months ago
2011
—We present a discriminative part-based approach for human action recognition from video sequences using motion features. Our model is based on the recently proposed hidden condi...
157
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far...
175
click to vote
SIGMOD
2012
ACM
13 years 4 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
116
click to vote
DCC
2008
IEEE
16 years 1 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...