Sciweavers

7623 search results - page 1133 / 1525
» Algorithmic Features of Eclat
Sort
View
190
Voted
WWW
2007
ACM
16 years 7 months ago
Deriving knowledge from figures for digital libraries
Figures in digital documents contain important information. Current digital libraries do not summarize and index information available within figures for document retrieval. We pr...
Xiaonan Lu, James Ze Wang, Prasenjit Mitra, C. Lee...
WWW
2005
ACM
16 years 7 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
CAV
2009
Springer
157views Hardware» more  CAV 2009»
16 years 7 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
163
Voted
KDD
2009
ACM
207views Data Mining» more  KDD 2009»
16 years 7 months ago
DynaMMo: mining and summarization of coevolving sequences with missing values
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
16 years 7 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
« Prev « First page 1133 / 1525 Last » Next »