1265 search results - page 30 / 253 » Randomized Algorithms and Probabilistic Analysis in Wireless... |
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
AE
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
ICOIN
2004
Springer
14 years 1 months ago
2004
Springer
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...