7913 search results - page 193 / 1583 » Information Collection on a Graph |
OPODIS
2007
13 years 11 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
SAC
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. To this end, we d...
ERCIMDL
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. This paper examines technology developed to support largescale distributed digital libraries. We describe the method used for harvesting collection information using stan...
WWW
2001
ACM
14 years 11 months ago
2001
ACM
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
GD
1998
Springer
14 years 2 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...