Sciweavers

1778 search results - page 95 / 356
» The Theory of Probabilistic Databases
Sort
View
COLT
2007
Springer
16 years 10 days ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
NETWORKING
2004
15 years 7 months ago
Reducing Packet-Loss by Taking Long-Range Dependences into Account
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packetloss. Thanks to recent advances in the t...
J. Ignacio Alvarez-Hamelin, Pierre Fraigniaud
NIPS
2003
15 years 7 months ago
Optimal Manifold Representation of Data: An Information Theoretic Approach
We introduce an information theoretic method for nonparametric, nonlinear dimensionality reduction, based on the infinite cluster limit of rate distortion theory. By constraining...
Denis V. Chigirev, William Bialek
ENTCS
2007
140views more  ENTCS 2007»
15 years 6 months ago
Admissible Representations of Probability Measures
In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of Type-2 T...
Matthias Schröder
INDOCRYPT
2004
Springer
15 years 11 months ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora