Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IPL
2006
99views more  IPL 2006»
11 years 6 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
CORR
2006
Springer
151views Education» more  CORR 2006»
11 years 6 months ago
A general computation rule for lossy summaries/messages with examples from equalization
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Fr...
FCS
2006
11 years 8 months ago
Speeeding Up Markov Chain Monte Carlo Algorithms
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...
Andras Farago
FOSSACS
2004
Springer
12 years 2 days ago
Choice in Dynamic Linking
We introduce a computational interpretation for Hilbert’s choice operator (ε). This interpretation yields a typed foundation for dynamic linking in software systems. The use of ...
Martín Abadi, Georges Gonthier, Benjamin We...
FOCS
2006
IEEE
12 years 22 days ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
books