Sciweavers

16430 search results - page 155 / 3286
» On Computable Tree Functions
Sort
View
124
Voted
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 1 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
100
Voted
IJCAI
2003
15 years 5 months ago
Expressive Power of Tree and String Based Wrappers
There exist two types of wrappers: the string based wrapper such as the LR wrapper, and the tree based wrapper. A tree based wrapper designates extraction regions by nodes on the ...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa
125
Voted
ACTA
2008
88views more  ACTA 2008»
15 years 2 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
131
Voted
MICCAI
2010
Springer
15 years 2 months ago
Reconstructing Geometrically Consistent Tree Structures from Noisy Images
Abstract. We present a novel approach to fully automated reconstruction of tree structures in noisy 2D images. Unlike in earlier approaches, we explicitly handle crossovers and bif...
Engin Türetken, Christian Blum, Germán...
137
Voted
CN
2002
161views more  CN 2002»
15 years 3 months ago
Building multicast services from unicast forwarding and ephemeral state
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...
Su Wen, Jim Griffioen, Kenneth L. Calvert