243 search results - page 45 / 49 » Scalable mining of large disk-based graph databases |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
KDD
2009
ACM
14 years 2 days ago
2009
ACM
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...