2520 search results - page 80 / 504 » The complexity of approximating entropy |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
104
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
ISCAS
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...
107
click to vote
JMLR
2011
14 years 5 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 ...
88
Voted
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...