Sciweavers

736 search results - page 22 / 148
» Approximating the Number of Network Motifs
Sort
View
PODC
2006
ACM
15 years 3 months ago
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju
ML
2012
ACM
413views Machine Learning» more  ML 2012»
13 years 5 months ago
Gradient-based boosting for statistical relational learning: The relational dependency network case
Dependency networks approximate a joint probability distribution over multiple random variables as a product of conditional distributions. Relational Dependency Networks (RDNs) are...
Sriraam Natarajan, Tushar Khot, Kristian Kersting,...
VTC
2010
IEEE
167views Communications» more  VTC 2010»
14 years 7 months ago
The Impact of Fading on the Outage Probability in Cognitive Radio Networks
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
Yaobin Wen, Sergey Loyka, Abbas Yongaçoglu
BMCBI
2008
208views more  BMCBI 2008»
14 years 10 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 2 months ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia