Sciweavers

886 search results - page 130 / 178
» On the Autoreducibility of Random Sequences
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
13 years 7 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
TIT
2002
101views more  TIT 2002»
13 years 7 months ago
Large-system performance analysis of blind and group-blind multiuser receivers
We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samp...
Junshan Zhang, Xiaodong Wang
GLOBECOM
2010
IEEE
13 years 5 months ago
Automatic Gain Control for ADC-Limited Communication
As the date rates and bandwidths of communication systems scale up, the cost and power consumption of highprecision (e.g., 8-12 bits) analog-to-digital converters (ADCs) become pro...
Feifei Sun, Jaspreet Singh, Upamanyu Madhow
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 4 months ago
Real-time Robust Principal Components' Pursuit
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...
Chenlu Qiu, Namrata Vaswani
BMCBI
2011
13 years 2 months ago
Empirical Bayesian models for analysing molecular serotyping microarrays
Background: Microarrays offer great potential as a platform for molecular diagnostics, testing clinical samples for the presence of numerous biomarkers in highly multiplexed assay...
Richard Newton, Jason Hinds, Lorenz Wernisch