256 search results - page 8 / 52 » Sparse random graphs with clustering |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
EMNLP
2010
13 years 5 months ago
2010
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
AAAI
2008
13 years 9 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
IM
2008
13 years 7 months ago
2008
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...