Sciweavers

1284 search results - page 115 / 257
» Data Structures for Mergeable Trees
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Graph Matching using Commute Time Spanning Trees
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
Edwin R. Hancock, Huaijun Qiu
P2P
2008
IEEE
120views Communications» more  P2P 2008»
14 years 2 months ago
Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks
Trees are fundamental structures for data dissemination in large-scale network scenarios. However, their inherent fragility has led researchers to rely on more redundant mesh topo...
Davide Frey, Amy L. Murphy
NIME
2004
Springer
114views Music» more  NIME 2004»
14 years 1 months ago
Tree Music: Composing with GAIA
In this report, we discuss Tree Music, an interactive computer music installation created using GAIA (Graphical Audio Interface Application), a new open-source interface for contr...
Judith Shatin, David Topper
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
INFOCOM
2007
IEEE
14 years 2 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin