Sciweavers

5785 search results - page 72 / 1157
» Approximability of Probability Distributions
Sort
View
IJAR
2008
74views more  IJAR 2008»
15 years 1 months ago
Unifying practical uncertainty representations - I: Generalized p-boxes
Abstract. There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probabi...
Sébastien Destercke, Didier Dubois, Eric Ch...
MT
2010
96views more  MT 2010»
14 years 12 months ago
Monte Carlo techniques for phrase-based translation
Recent advances in statistical machine translation have used approximate beam search for NP-complete inference within probabilistic translation models. We present an alternative ap...
Abhishek Arun, Barry Haddow, Philipp Koehn, Adam L...
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
15 years 6 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath
106
Voted
IPSN
2010
Springer
15 years 8 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
ICC
2007
IEEE
15 years 7 months ago
Using Client Puzzles to Mitigate Distributed Denial of Service Attacks in the Tor Anonymous Routing Environment
— A novel client puzzle protocol, the Memoryless Puzzle Protocol (MPP), is proposed and investigated. The goal is to show that MPP is a viable solution for mitigating distributed...
Nicholas A. Fraser, Douglas J. Kelly, Richard A. R...