Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This paper studies implementations of concurrent objects that exploit the absence of step contention. These implementations use only reads and writes when a process is running solo. The other processes might be busy with other objects, swapped-out, failed, ...
In this paper we analyse the optimal infinite-horizon advertising policy of a monopolist firm in a market for durable goods, based on classic models by Vidale–Wolfe (Oper. Res. 1957; 5(3):370–381) and Nerlove–Arrow (Economica 1962; 29 (114):129–142). A set ...
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the “natural” spline basis function as generator for a shift-invariant function space; i.e., the tensor-product B-spli ...
The ability to design efficient distributed communications systems heavily depends on a proper understanding of the distortion incurred by their constituting elements. To this end, we study the mean squared reconstruction error behavior of the distributed ...
Abstract—In this paper, a model is proposed to analyze the influence of timing imperfections on ultra-wide bandwidth (UWB) time-hopping spread-spectrum (TH-SS) signaling schemes, where N pulses are coherently added to increase the received signal-tonoise r ...
Recently, some collisions have been exposed for a variety of cryptographic hash functions including some of the most widely used today. Many other hash functions using similar constructions can however still be considered secure. Nevertheless, this has dra ...
Consider a set of correlated sources located at the nodes of a network, and a sink to which the data from all the sources has to arrive. We address the minimization of a separable joint communication cost function given by the product [rate] × [edge ...
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...
This thesis addresses the topic of Low-Density Parity-Check (LDPC) code analysis, both asymptotically and for finite block lengths. Since in general it is a difficult problem to analyze individual code instances, ensemble averages are studied by following ...
This paper provides an asymptotic performance evaluation of network-based or multilateral positioning systems, where the times and/or angles of arrival of the signals traveling from a mobile station (MS) to a set of fixed stations (FSs) are used to estimat ...
Institute of Electrical and Electronics Engineers2004
