Page Views on Nuit Blanche since July 2010

My papers on ArXiv:
Approximating Kernels at the speed of Light
&
Imaging with Nature

LightOn
LinkedIn (727)|| on CrunchBase || our Blog
(2452)
(3967)
(1333)||
Attendant references pages:
The Advanced Matrix Factorization Jungle Page ||

Paris Machine Learning
@Meetup.com (8016 members) || @Archives

Thursday, June 26, 2008

CS: Compressed sensing and transference talk.

The Colloque D'Analyse Harmonique D'Orsay will feature a talk by Yves Meyer at 2:10 till 3:00 pm on July 9th. The title of the talk is "Compressed sensing and transference".

What's transference you say ? Google says this. But I personally don't know, Terry Tao defines a transference principle:

This theorem does not directly apply to the prime numbers {\mathcal P}, as they have density zero, but it turns out that there is a trick (which Ben Green and I call the transference principle) which (very roughly speaking) lets one locate a dense set of integers A which “models” the primes, in the sense that there is a relationship between additive patterns in A and additive patterns in {\mathcal P}. (The relationship here is somewhat analogous to Monte Carlo integration, which uses the average value of a function f on a sparse set to approximate the average value of f on a much larger domain.) As a consequence of this principle, Ben and I were able to use Szemerédi’s theorem to establish that the primes contained arbitrarily long arithmetic progressions.

Primes number subsets, mmmhhh, it looks like an extension of his previous result. We'll see.