Sciweavers

71 search results - page 10 / 15
» Call Graph Prefetching for Database Applications
Sort
View
HT
1991
ACM
15 years 3 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 2 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
KDD
2006
ACM
381views Data Mining» more  KDD 2006»
16 years 11 hour ago
GPLAG: detection of software plagiarism by program dependence graph analysis
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
Chao Liu 0001, Chen Chen, Jiawei Han, Philip S. Yu
CIKM
2009
Springer
15 years 6 months ago
Group CRM: a new telecom CRM framework from social network perspective
The structure of customer communication network provides us a natural way to understand customers’ relationships. Traditional customer relationship management (CRM) methods focu...
Bin Wu, Qi Ye, Shengqi Yang, Bai Wang
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 11 hour ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...