Sciweavers

2996 search results - page 47 / 600
» Numberings and Randomness
Sort
View
ICPR
2006
IEEE
14 years 11 months ago
Scene recovery from many randomly distributed single pixel cameras
This paper examines two scene recovery problems arising when interpreting data from massive numbers of randomly distributed single pixel cameras. Assuming that the camera position...
Robert B. Fisher
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 10 months ago
Combinatorial Approximation Algorithms for MaxCut using Random Walks
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
Satyen Kale, C. Seshadhri
CORR
2000
Springer
71views Education» more  CORR 2000»
13 years 9 months ago
Smoothness and decay properties of the limiting Quicksort density function
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
James Allen Fill, Svante Janson
TIT
2008
76views more  TIT 2008»
13 years 9 months ago
A Quasi-Random Approach to Space-Time Codes
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
Keying Y. Wu, Li Ping
TIT
2008
121views more  TIT 2008»
13 years 9 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut