Sciweavers

4009 search results - page 577 / 802
» Clustering on Complex Graphs
Sort
View
ACSW
2006
15 years 8 months ago
Simulating a computational grid with networked animat agents
Computational grids are now widespread, but their large-scale behaviour is still poorly understood. We report on some calculations of loading, scaling and utilisation behaviours o...
Kenneth A. Hawick, Heath A. James
UAI
2001
15 years 8 months ago
Improved learning of Bayesian networks
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
Tomás Kocka, Robert Castelo
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 6 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 6 months ago
Topological analysis of the power grid and mitigation strategies against cascading failures
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...
Sakshi Pahwa, Amelia Hodges, Caterina M. Scoglio, ...
CVIU
2008
141views more  CVIU 2008»
15 years 6 months ago
Change detection using a statistical model in an optimally selected color space
We present a new noise model for color channels for statistical change detection. Based on this noise modeling, we estimate the distribution of Euclidean distances between the pix...
Youngbae Hwang, Jun-Sik Kim, In-So Kweon