KDD
15 years 9 months ago
2006 ACM
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...
107
click to vote
ICDM
15 years 2 months ago
2006 IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
DMIN
14 years 10 months ago
2006
This paper presents the results of classifying Arabic text documents using the N-gram frequency statistics technique employing a dissimilarity measure called the "Manhattan di...
JODS
14 years 8 months ago
2006 KDD
15 years 9 months ago
2006 ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
|