Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
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.
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
We prove a version of the Lp hodge decomposition for differential forms in Euclidean space and a generalization to the class of Lizorkin currents. We also compute the Lqp−cohomology of Rn. ...
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 ...
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 ...
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
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 ...
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 ...
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 ...
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
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, ...
