Sciweavers

8695 search results - page 233 / 1739
» Making the Complex Simple
Sort
View
SPAA
2010
ACM
15 years 6 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 6 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
VTC
2008
IEEE
127views Communications» more  VTC 2008»
16 years 1 months ago
A Low-Complexity Precoder for Large Multiuser MISO Systems
—In this paper, we consider the problem of precoding in large multiuser MISO systems, where by ‘large’ we mean i) large number of transmit antennas (Nt) at the base station o...
Saif K. Mohammed, Ananthanarayanan Chockalingam, B...
SLIP
2003
ACM
15 years 12 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
207
Voted
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 11 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek