output
20072011
most citedAdaptive Importance Sampling in General Mixture Classes

208 citations

researchers with a paper here
collaborating institutions
Showing 2010Show all

29 papers · 1 filter

cs.DS2010

Non-redundant random generation from weighted context-free languages

Yann Ponty

We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of…

cs.IT2010★ 16 cited

Differential Privacy versus Quantitative Information Flow

Mário S. Alvim, Konstantinos Chatzikokolakis, Pierpaolo Degano +1

Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient priva…

cs.IT2010★ 3 cited

List-decoding of binary Goppa codes up to the binary Johnson bound

Daniel Augot, Morgan Barbier, Alain Couvreur

We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet…

math.DS2010

Preliminary Functional-Structural Modeling on Poplar (Salicaceae)

Dongxiang Liu, Meng Zhen Kang, Véronique Letort +4

Poplar is one of the best fast-growing trees in the world, widely used for windbreak and wood product. Although architecture of poplar has direct impact on its applications, it has…

cs.DB2010★ 16 cited

Distributed XML Design

S. Abiteboul, G. Gottlob, M. Manna

A distributed XML document is an XML document that spans several machines. We assume that a distribution design of the document tree is given, consisting of an XML kernel-document…

cs.DS2010★ 3 cited

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models

Danièle Gardy, Yann Ponty

The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weight…