Results 1  10
of
660
Strong anonymity and infinite streams
, 2011
"... Abstract. The extended rankdiscounted utilitarian social welfare order introduced and axiomatized by Stéphane Zuber and Geir B. Asheim satisfies strong anonymity (J. Econ. Theory (2011), doi:10.1016/j.jet.2011.08.001). We question the appropriateness of strong anonymity in the context of a countab ..."
Abstract
 Add to MetaCart
countably infinite sequence of subsequent generations. A modified criterion that is incomplete and satisfies finite anonymity is presented. Keywords. Intergenerational equity · Discounted utilitarianism
A coalgebraic view on biinfinite streams
"... Biinfinite streams arise as a natural data structure in several contexts, such as signal processing [1], symbolic dynamics [2], (balanced) representation of real/rational numbers [3] or study of sets invariant under shift transformation [4]. In this paper, we will present a coalgebraic view of the ..."
Abstract
 Add to MetaCart
Biinfinite streams arise as a natural data structure in several contexts, such as signal processing [1], symbolic dynamics [2], (balanced) representation of real/rational numbers [3] or study of sets invariant under shift transformation [4]. In this paper, we will present a coalgebraic view
Differentially Private Event Sequences over Infinite Streams
"... Numerous applications require continuous publication of statistics for monitoring purposes, such as realtime traffic analysis, timely disease outbreak discovery, and social trends observation. These statistics may be derived from sensitive user data and, hence, necessitate privacy preservation. A n ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
notable paradigm for offering strong privacy guarantees in statistics publishing is ϵdifferential privacy. However, there is limited literature that adapts this concept to settings where the statistics are computed over an infinite stream of “events ” (i.e., data items generated by the users
SEQUENTIAL LOCAL FRI SAMPLING OF INFINITE STREAMS OF DIRACS
"... The theory of sampling signals with finite rate of innovation (FRI) has shown that it is possible to perfectly recover classes of nonbandlimited signals such as streams of Diracs from uniform samples. Most of previous papers, however, have to some extent only focused on the sampling of periodic or ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
or finite duration signals. In this paper we propose a novel method that is able to reconstruct infinite streams of Diracs, even in high noise scenarios. We sequentially process the discrete samples and output locations and amplitudes of the Diracs in realtime. We first establish conditions for perfect
Refining Infinite Stream Behaviours By Bound Functions
, 2000
"... Stream processing functions form an abstract model of distributed systems where the components concurrently process their input streams and asynchronously communicate their results. The finite resp. infinite behaviour of a deterministic component is described by a function on finite resp. on infinit ..."
Abstract
 Add to MetaCart
Stream processing functions form an abstract model of distributed systems where the components concurrently process their input streams and asynchronously communicate their results. The finite resp. infinite behaviour of a deterministic component is described by a function on finite resp
Static optimization of conjunctive queries with sliding windows over infinite streams
 In SIGMOD
, 2004
"... We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of optimization should be to find an execution plan that minimizes resource usage within the available resource constraints ..."
Abstract

Cited by 53 (1 self)
 Add to MetaCart
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of optimization should be to find an execution plan that minimizes resource usage within the available resource
Raptor codes
 IEEE Transactions on Information Theory
, 2006
"... LTCodes are a new class of codes introduced in [1] for the purpose of scalable and faulttolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LTCodes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
: for a given integer k, and any real ε> 0, Raptor codes in this class produce a potentially infinite stream of symbols such that any subset of symbols of size k(1 + ε) is sufficient to recover the original k symbols with high probability. Each output symbol is generated using O(log(1/ε)) operations
Approximate StrangFix: Sampling Infinite Streams of Diracs with any Kernel∗
"... In the last few years, several new methods have been developed for the sampling and the exact reconstruction of specific classes of nonbandlimited signals known as signals with finite rate of innovation (FRI). This is achieved by using adequate sampling kernels and reconstruction schemes. An import ..."
Abstract
 Add to MetaCart
constraint, we thus allow for a controlled error in the reproduction formula in order to use the exponential reproduction idea with any kernel and develop a reconstruction method which is more robust to noise. We also present a novel method that is able to reconstruct infinite streams of Diracs, even in high
HigherOrder Predictive Information for Learning an Infinite Stream of Episodes
"... We consider the problem of lifelong learning from an indefinite stream of temporal episodes, i.e. a time series consisting of episodes, where the number of the episodes is potentially infinite and the length of each episode varies. Examples of this class of learning include a humanoid robot that con ..."
Abstract
 Add to MetaCart
We consider the problem of lifelong learning from an indefinite stream of temporal episodes, i.e. a time series consisting of episodes, where the number of the episodes is potentially infinite and the length of each episode varies. Examples of this class of learning include a humanoid robot
Sampling signals with finite rate of innovation
 IEEE Transactions on Signal Processing
, 2002
"... Abstract—Consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials ..."
Abstract

Cited by 350 (67 self)
 Add to MetaCart
“bandlimited and sinc kernel ” case. In particular, we show how to sample and reconstruct periodic and finitelength streams of Diracs, nonuniform splines, and piecewise polynomials using sinc and Gaussian kernels. For infinitelength signals with finite local rate of innovation, we show local sampling
Results 1  10
of
660