Sciweavers

3396 search results - page 128 / 680
» Tree representations of graphs
Sort
View
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
RELMICS
2000
Springer
14 years 18 days ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
ICASSP
2011
IEEE
13 years 22 days ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
CHI
2009
ACM
14 years 9 months ago
A user study on visualizing directed edges in graphs
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
Danny Holten, Jarke J. van Wijk
DLT
2004
13 years 10 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti