1284 search results - page 169 / 257 » Data Structures for Mergeable Trees |
NIPS
1990
14 years 11 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
INFOVIS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate the use of elastic hierarchies for representing trees, where a single graphical depiction uses a hybrid mixture, or “interleaving”, of more basic forms at diffe...
INFOVIS
1997
IEEE
15 years 2 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
108
click to vote
AINTEC
2006
Springer
15 years 1 months ago
2006
Springer
AOMP (Ad-hoc Overlay Multicast Protocol) is a novel approach for application-layer multicast in ad-hoc networks. We introduce in this paper a new algorithm that exploits a few prop...
100
click to vote
BIRTHDAY
2008
Springer
15 years 2 days ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...