Sciweavers

4377 search results - page 71 / 876
» Mass problems and randomness
Sort
View
EUROPAR
2005
Springer
15 years 3 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
FOCS
2010
IEEE
14 years 7 months ago
The Monotone Complexity of k-clique on Random Graphs
It is widely suspected that Erdos-R
Benjamin Rossman
APPROX
2007
Springer
88views Algorithms» more  APPROX 2007»
15 years 4 months ago
Derandomization of Euclidean Random Walks
We consider the problem of derandomizing random walks in the Euclidean space Rk . We show that for k = 2, and in some cases in higher dimensions, such walks can be simulated in Lo...
Ilia Binder, Mark Braverman
MASS
2010
14 years 7 months ago
Geography-aware active data dissemination in mobile social networks
Abstract--In mobile social networks (MSNets), data dissemination is an important topic, which has not been widely investigated yet. Active data dissemination is a networking paradi...
Jialu Fan, Yuan Du, Wei Gao, Jiming Chen, Youxian ...
FOCM
2007
76views more  FOCM 2007»
14 years 9 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale