Sciweavers

872 search results - page 63 / 175
» Extreme lower probabilities
Sort
View
TCOM
2011
85views more  TCOM 2011»
14 years 7 months ago
Exploiting Sparse User Activity in Multiuser Detection
—The number of active users in code-division multiple access (CDMA) systems is often much lower than the spreading gain. The present paper exploits fruitfully this a priori infor...
Hao Zhu, Georgios B. Giannakis
94
Voted
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 10 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
91
Voted
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 7 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu
89
Voted
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 6 months ago
New Results on the Complexity of the Middle Bit of Multiplication
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
Ingo Wegener, Philipp Woelfel
PAKDD
2009
ACM
94views Data Mining» more  PAKDD 2009»
15 years 5 months ago
Item Preference Parameters from Grouped Ranking Observations
Given a set of rating data for a set of items, determining the values of items is a matter of importance and various probability models have been proposed. The Plackett-Luce model ...
Hideitsu Hino, Yu Fujimoto, Noboru Murata