Sciweavers

2237 search results - page 240 / 448
» On the Security of Random Sources
Sort
View
VTC
2006
IEEE
16 years 1 months ago
Scheduling in Cellular CDMA-TDD Networks
Abstract— In this paper different scheduling algorithms applied to cellular CDMA (code division multiple access) systems with different duplexing modes are studied. In particular...
Ellina Foutekova, Patrick Agyapong, Birendra Ghimi...
AAAI
2004
15 years 8 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 8 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
CORR
2008
Springer
87views Education» more  CORR 2008»
15 years 7 months ago
The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel
For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance ca...
Tal Philosof, Ram Zamir
ICASSP
2011
IEEE
14 years 11 months ago
Maximum likelihood ICA of quaternion Gaussian vectors
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
Javier Vía, Daniel P. Palomar, Luis Vielva,...