Sciweavers

745 search results - page 92 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
98
Voted
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 1 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
87
Voted
MONET
2007
110views more  MONET 2007»
15 years 3 days ago
Multi-hop Clustering Based on Neighborhood Benchmark in Mobile Ad-hoc Networks
— Large-scale mobile ad-hoc networks require flexible and stable clustered network structure for efficient data collection and dissemination. In this paper, a scheme is present...
Stephen S. Yau, Wei Gao
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
15 years 5 months ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
108
Voted
HICSS
2005
IEEE
154views Biometrics» more  HICSS 2005»
15 years 6 months ago
Market Structure and the Predictability of Electricity System Line Flows: An Experimental Analysis
Robert Thomas has shown, using simulations of experimental results, that the power flow on any line in an electric network is linearly proportional to the total system load when t...
Nodir Adilov, Thomas Light, Richard E. Schuler, Wi...
87
Voted
DAGSTUHL
2007
15 years 2 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari