Concept

Algorithme de Lloyd-Max

Publications associées (34)

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

Pedestrian-oriented Flow Characterization

Michel Bierlaire, Marija Nikolic

Definitions of flow indicators are derived by adapting Edie's definitions through a stream-based approach and a data-driven spatio-temporal discretization framework. The stream-based approach accounts for the multidirectional nature of pedestrian flows. Th ...

2014

Discovering places of interest in everyday life from smartphone data

Daniel Gatica-Perez

In this paper, a new framework to discover places-of-interest from multimodal mobile phone data is presented. Mobile phones have been used as sensors to obtain location information from users’ real lives. A place-of-interest is defined as a location where ...

Springer2013

One-Bit Measurements With Adaptive Thresholds

Michaël Unser, Arash Amini, Ulugbek Kamilov, Aurélien Bourquard

We introduce a new method for adaptive one-bit quantization of linearmeasurements and propose an algorithm for the recovery of signals based on generalized approximate message passing (GAMP). Our method exploits the prior statistical information on the sig ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Thresholding-based reconstruction of compressed correlated signals

Pascal Frossard, Alhussein Fawzi, Tamara Tosic

We consider the problem of recovering a set of correlated signals (\emph{e.g.,} images from different viewpoints) from a few linear measurements per signal. We assume that each sensor in a network acquires a compressed signal in the form of linear measurem ...

2012

When bigger is better

Michael Herzog, Bilge Sayim, Mauro Manassi

One of the main factors of crowding is the spacing between target and flankers. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...

2011

How grouping determines crowding

Michael Herzog, Bilge Sayim, Mauro Manassi

The spacing between target and flankers is one of the main factors of crowding. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...

2011

Sparsity Driven People Localization with a Heterogeneous Network of Cameras

Pierre Vandergheynst, Alexandre Massoud Alahi, Laurent Jacques

In this paper, we propose to study the problem of localization of a dense set of people with a network of heterogeneous cameras. We propose to recast the problem as a linear inverse problem. The proposed framework is generic to any scene, scalable in the n ...

Springer Verlag2011

Discovering Human Places of Interest from Multimodal Mobile Phone Data

Daniel Gatica-Perez

In this paper, a new framework to discover places-of-interest from multimodal mobile phone data is presented. Mobile phones have been used as sensors to obtain location information from usersâ€™ real lives. Two levels of clustering are used to obtain place ...

2010

P2P video broadcast with latency and utility optimization

Pascal Frossard

We consider the problem of mesh-pull based video broadcast in peer-to-peer networks. We propose a novel algorithm for constructing the distribution overlay, where peers are arranged in neighborhoods that exhibit similar latency values from the origin media ...

2009

Graph Chatbot

Chattez avec Graph Search

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.

Connectez-vous pour utiliser Chat avec Graph Search