941 search results - page 107 / 189 » Efficient Testing of Large Graphs |
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
PRL
2006
14 years 9 months ago
2006
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is...
SOCIALCOM
2010
14 years 7 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
75
Voted
NIPS
2004
14 years 11 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....