Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...
A dynamic universal accumulator is an accumulator that allows one to efficiently compute both membership and nonmembership witnesses in a dynamic way. It was first defined and instantiated by Li et al., based on the Strong RSA problem, building on the dyna ...
The main goal of this project is to build a mean and to populate a database with correct information regarding some decided pairings. This database will then be compared to the results of algorithms that process the same pairings, which provides a way to a ...
We prove that solutions of a mildly regularized Perona–Malik equation converge, in a slow time scale, to solutions of the total variation flow. The convergence result is global-in-time, and holds true in any space dimension. The proof is based on the gener ...
New entrants in postal markets usually set up delivery networks by concentrating on urban areas and large business customers. This implies that they operate their network highly centralized - at least in early phases of entrance. ...
Let n >= 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight-line edges such that the angle between any two consecutive edges is at m ...
What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simpl ...
In this paper, we consider the use of object duplicate detection for the propagation of geotags from a small set of images with location names (IPTC) to a large set of non-tagged images. The motivation behind this idea is that images of individual location ...
Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2010
In this paper, we propose an approach for photo album summarization through a novel social game "Epitome" for mobile phones. Our approach to album summarization consists of two games: "Select the Best!" and "Split it!". The goal of the first game is to all ...
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...