Sciweavers

500 search results - page 51 / 100
» Improving Search in Peer-to-Peer Networks
Sort
View
AAAI
2008
15 years 2 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong
DICS
2006
15 years 3 months ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...
MASCOTS
2003
15 years 1 months ago
Minimizing Packet Loss by Optimizing OSPF Weights Using Online Simulation
In this paper, we present a scheme for minimizing packet loss in OSPF networks by optimizing link weights using Online Simulation. We have chosen packet loss rate in the network a...
Hema Tahilramani Kaur, Tao Ye, Shivkumar Kalyanara...
TKDE
2011
176views more  TKDE 2011»
14 years 6 months ago
Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems
—This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experienc...
Haifeng Chen, Wenxuan Zhang, Guofei Jiang
WWW
2008
ACM
16 years 15 days ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta