Sciweavers

3265 search results - page 145 / 653
» Representing Groups on Graphs
Sort
View
IPPS
2010
IEEE
15 years 1 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 1 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang
ICASSP
2011
IEEE
14 years 7 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski
CVPR
2009
IEEE
16 years 11 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 4 months ago
Efficient aggregation for graph summarization
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...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...