745 search results - page 78 / 149 » On Generating Random Network Structures: Connected Graphs |
132
click to vote
KAIS
2011
14 years 7 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
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...
122
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
100
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
Heterogeneous object co-clustering has become an important research topic in data mining. In early years of this research, people mainly worked on two types of heterogeneous data ...
134
click to vote
ITBAM
2010
14 years 11 months ago
2010
A prediction model that exploits the past medical patient history to determine the risk of individuals to develop future diseases is proposed. The model is generated by using the s...