Sciweavers

126 search results - page 2 / 26
» Lossless Representation of Graphs using Distributions
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
13 years 11 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
SPAA
2009
ACM
14 years 6 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
IPPS
2009
IEEE
14 years 6 days ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 5 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....
PPOPP
2012
ACM
12 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao