Sciweavers

13214 search results - page 349 / 2643
» Pseudorandomness for network algorithms
Sort
View
STOC
1995
ACM
117views Algorithms» more  STOC 1995»
15 years 10 months ago
Lower bounds for sorting networks
Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. ...
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
15 years 8 months ago
Linked decompositions of networks and the power of choice in Polya urns
Henry C. Lin, Christos Amanatidis, Martha Sideri, ...
DIALM
2010
ACM
138views Algorithms» more  DIALM 2010»
15 years 8 months ago
Data transmission and base-station placement for optimizing network lifetime
Esther M. Arkin, Valentin Polishchuk, Alon Efrat, ...
IJAR
2008
83views more  IJAR 2008»
15 years 6 months ago
Decision-theoretic specification of credal networks: A unified language for uncertain modeling with sets of Bayesian networks
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
Alessandro Antonucci, Marco Zaffalon
WOWMOM
2006
ACM
110views Multimedia» more  WOWMOM 2006»
16 years 22 days ago
Minimum Cost Wireless Broadband Overlay Network Planning
Wireless broadband networks, especially WiMAX networks, have emerged in the industry recently and many challenging research issues arise. In this paper, we proposed a heuristic cl...
Peng Lin, Hung Q. Ngo, Chunming Qiao, Xin Wang, Ti...