289 search results - page 6 / 58 » A Framework for Visualising Large Graphs |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
141
click to vote
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
ICPP
2008
IEEE
15 years 3 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
101
click to vote
SIGMOD
2012
ACM
12 years 12 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
122
click to vote
JPDC
2007
14 years 9 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...