1756 search results - page 136 / 352 » Mapping Small Worlds |
309
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
144
click to vote
I3
2007
15 years 5 months ago
2007
The main objective of this work is to exploit the relationship between the information findability problem and a subject-based organization of information. Identification of a sub...
161
click to vote
IJCAI
2007
15 years 5 months ago
2007
A central goal of robotics and AI is to be able to deploy an agent to act autonomously in the real world over an extended period of time. It is commonly asserted that in order to ...
153
Voted
JODL
2000
15 years 4 months ago
2000
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
167
click to vote
WWW
2011
ACM
14 years 11 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...