3267 search results - page 477 / 654 » Generalized quasirandom graphs |
164
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic mo...
294
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
200
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Temporal Text Mining (TTM) is concerned with discovering temporal patterns in text information collected over time. Since most text information bears some time stamps, TTM has man...
206
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
166
click to vote
KDD
2004
ACM
16 years 7 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...