2957 search results - page 188 / 592 » The Complexity of Polynomial-Time Approximation |
181
click to vote
JMLR
2011
15 years 1 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
171
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
164
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
138
click to vote
CRYPTO
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
207
Voted
DLOG
2009
15 years 4 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...