Concept

Number

Related publications (96)

Graph Chatbot

Chat with Graph Search

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.

Method and apparatus for multiple object tracking with k-shortest paths

Pascal Fua, François Fleuret, Jérôme Berclaz

Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...

2013

The number of distinct distances from a vertex of a convex polygon

János Pach, Rom Pinchasi, Gabriel Nivasch

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...

2013

Optimal Sampling Rates in Infinite-Dimensional Compressed Sensing

Martin Vetterli, Loïc Arnaud Baboulaz, Mitra Fatemi

The theory of compressed sensing studies the problem of recovering a high dimensional sparse vector from its projections onto lower dimensional subspaces. The recently introduced framework of infinite-dimensional compressed sensing [1], to some extent gene ...

2013

On the proportion of upward flashes to lightning research towers

Marcos Rubinstein, Wolfgang Schulz

We compare in this paper direct measurements obtained on the towers on San Salvatore Mountain (Switzerland) and on the Gaisberg Mountain (Austria). They are situated in similar topographical environments but in different lightning activity zones. Direct me ...

Elsevier2013

Small distances in convex polygons

Filip Moric

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier Science Bv2013

Consensus in the presence of mortal Byzantine faulty processes

Martin Biely

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model "mortal Byzantine". After discussing some application examples ...

Springer Verlag2012

On isogeny classes of Edwards curves over finite fields

Robert Granger

We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is isogeno ...

Elsevier2012

Considerations on double exponential-based cubatures for the computation of weakly singular Galerkin inner products

Juan Ramon Mosig, Michael Mattes, Ioannis Koufogiannis

Highly accurate and efficient cubatures based on the double exponential quadrature rules are presented for the computation of weakly singular integrals arising in Galerkin mixed potential integral equation formulations. Due to their unique ability to handl ...

Institute of Electrical and Electronics Engineers2012

A Social Media Platform in Higher Education

Denis Gillet, Christophe Salzmann, Na Li, Evgeny Bogdanov

This paper reports on the successful use of Graasp, a social media platform, by university students for their collaborative work. Graasp features a number of innovations, such as administrator-free creation of collaborative spaces, context-aware recommenda ...

2012

Polar coding schemes for the AWGN channel

Emmanuel Abbé

This paper investigates polar coding schemes achieving capacity for the AWGN channel. The approaches using a multiple access channel with a large number of binary-input users and a single-user channel with a large prime-cardinality input are compared with ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011