Sciweavers

552 search results - page 23 / 111
» Observable Graphs
Sort
View
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
GD
2004
Springer
14 years 1 months ago
Intersection Reverse Sequences and Geometric Applications
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
Adam Marcus, Gábor Tardos
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
14 years 8 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
CASES
2007
ACM
14 years 2 days ago
An optimistic and conservative register assignment heuristic for chordal graphs
This paper presents a new register assignment heuristic for procedures in SSA Form, whose interference graphs are chordal; the heuristic is called optimistic chordal coloring (OCC...
Philip Brisk, Ajay K. Verma, Paolo Ienne
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 8 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...