15073 search results - page 337 / 3015 » Probabilistic algorithms for computing resultants |
130
click to vote
JMLR
2010
14 years 11 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
136
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
139
Voted
GCC
2005
Springer
15 years 10 months ago
2005
Springer
The multidimensional analysis based on data cube has been growing interest. However existing data cube model usually does not have the semantics of attributes and hence the analysi...
149
click to vote
ICML
2005
IEEE
16 years 5 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...
132
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...