290 search results - page 16 / 58 » Local Partitioning for Directed Graphs Using PageRank |
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
112
Voted
WWW
2004
ACM
16 years 10 days ago
2004
ACM
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web h...
111
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
76
Voted
AMC
2008
14 years 11 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
98
Voted
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...