Sciweavers

13214 search results - page 210 / 2643
» Pseudorandomness for network algorithms
Sort
View
LION
2009
Springer
112views Optimization» more  LION 2009»
16 years 1 months ago
A Graph-Based Semi-supervised Algorithm for Protein Function Prediction from Interaction Maps
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
Valerio Freschi
INFOCOM
2002
IEEE
15 years 11 months ago
Scheduling Algorithms for a Cache Pre-Filling Content Distribution Network
Abstract—Cache pre-filling is emerging as a new concept for increasing the availability of popular web items in cache servers. According to this concept, web items are sent by a...
Reuven Cohen, Liran Katzir, Danny Raz
ICASSP
2010
IEEE
15 years 6 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
FOCS
2008
IEEE
16 years 1 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
NCA
2005
IEEE
16 years 5 days ago
A Wide Area Network Simulation of Single-Round Group Membership Algorithms
A recent theoretical result proposed Sigma, a novel GM protocol that forms views using a singleround of message exchange. Prior GM protocols have required more rounds in the worst...
Roger Khazan, Sophia Yuditskaya