5606 search results - page 980 / 1122 » Randomization Techniques for Graphs. |
164
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the m...
181
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
We investigate techniques for visualizing time series data and evaluate their effect in value comparison tasks. We compare line charts with horizon graphs--a space-efficient time ...
176
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
157
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
164
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...