Sciweavers

1060 search results - page 77 / 212
» On the Discovery of Random Trees
Sort
View
CPC
2006
110views more  CPC 2006»
14 years 10 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
15 years 3 months ago
Identifying Markov Blankets with Decision Tree Induction
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
Lewis Frey, Douglas H. Fisher, Ioannis Tsamardinos...
INFOCOM
2005
IEEE
15 years 3 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
MMS
2010
14 years 4 months ago
InstantLeap: an architecture for fast neighbor discovery in large-scale P2P VoD streaming
In large-scale peer-to-peer (P2P) Video-on-Demand (VoD) streaming applications, a fundamental challenge is to quickly locate new supplying peers whenever a VCR command is issued, ...
Xuanjia Qiu, Wei Huang, Chuan Wu, Francis C. M. La...
77
Voted
MOBIHOC
2008
ACM
15 years 9 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic