Sciweavers

2553 search results - page 134 / 511
» Modeling Trees with Hypertextures
Sort
View
INFOVIS
2003
IEEE
15 years 3 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
QEST
2008
IEEE
15 years 4 months ago
A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation
Performance Trees are a unifying framework for the specification of performance queries involving measures and requirements. This paper describes an evaluation environment for Pe...
Darren K. Brien, Nicholas J. Dingle, William J. Kn...
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
15 years 3 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
SPIRE
2001
Springer
15 years 2 months ago
On Compression of Parse Trees
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path fr...
Jorma Tarhio