Publication

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Publications associées (62)

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

On the Hodge decomposition in $\mathbb{R}^n$

Marc Troyanov

We prove a version of the

L^p

hodge decomposition for differential forms in Euclidean space and a generalization to the class of Lizorkin currents. We also compute the

L_{qp}-

cohomology of

\mathbb{R}^n

. ...

2009

Fast, quasi-optimal, and pipelined instruction-set extensions

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, the AFUs must satisfy certain constraints in terms of read and write ports betw ...

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

Non-metric coordinates for predicting network proximity

Dan-Cristian Tomozei

We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is ...

IEEE2008

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...

2007

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

Average case analysis of multichannel thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

2007

The diffusion of Radon Shape

Victor Panaretos

In 1977, D. G. Kendall [J. Appl. Probab. 28 (1991), no. 1, 225--230; MR1090460 (92f:60135)] considered diffusions of shape induced by independent Brownian motions in Euclidean space. In this paper, we consider a different class of diffusions of shape, indu ...

2006

Geometrical Behaviours: An Architectural Mise-en-scène for a Reenactment of Lewis Carroll's Alice's Adventures in Wonderland

Caroline Dionne

The content of this thesis is two-fold. The first part takes the form of an essay while the second part presents a theoretical project for an architectural installation. Using these two modes as different ways to address similar issues, the present work pr ...

McGill University, Post-Graduate Masters (M.Arch) Theory of Architecture1999

Error-energy bounds for adaptive gradient algorithms

Ali H. Sayed

The paper establishes robustness, optimality, and convergence properties of the widely used class of instantaneous-gradient adaptive algorithms. The analysis is carried out in a purely deterministic framework and assumes no a priori statistical information ...

IEEE1996

New results about 3D digital lines

The current definition of 3D digital lines, which uses the 2D digital lines of closest integer points (Bresenham's lines) of two projections, has several drawbacks: the discrete topology of this 3D digital line notion is not clear; its third projection is, ...

SPIE-Int. Soc. Opt. Eng1996

On the Hodge decomposition in $\mathbb{R}^n$

Marc Troyanov

We prove a version of the

L^p

hodge decomposition for differential forms in Euclidean space and a generalization to the class of Lizorkin currents. We also compute the

L_{qp}-

cohomology of

\mathbb{R}^n

. ...

2009

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

2007