1284 search results - page 131 / 257 » Data Structures for Mergeable Trees |
122
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
129
click to vote
DEXA
2010
Springer
15 years 2 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
114
click to vote
CGF
2008
15 years 2 months ago
2008
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...
113
click to vote
DAC
2005
ACM
16 years 3 months ago
2005
ACM
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
100
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...