1629 search results - page 6 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
167
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
CIKM
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
SIGGRAPH
1997
ACM
15 years 1 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...