Filters








129,790 Hits in 3.0 sec

An evaluation of self-adjusting binary search tree techniques

Jim Bell, Gopal Gupta
1993 Software, Practice & Experience  
Much has been said in praise of self-adjusting data structures, particularly self-adjusting binary search trees.  ...  tree has better performance, in terms of CPU time, than any of the self-adjusting trees.  ...  than that of the self-adjusting trees, in particular top-down splaying.  ... 
doi:10.1002/spe.4380230403 fatcat:jwllductsrdhre6n4pkrfim5fe

Dynamic Trees [chapter]

Renato F. Werneck
2016 Encyclopedia of Algorithms  
Dynamic Trees Self-Adjusting Top Trees • Topmost compress tree represents the root path.  ...  Representation a b c d e f Y Z V W X ab N b N c cd bc N d N e ef de V W Y Z X Dynamic Trees • Representation: Self-Adjusting Top Trees• Splice: changes  ... 
doi:10.1007/978-1-4939-2864-4_121 fatcat:5wfpb444sjbwratipxfcnqilny

Dynamic trees in practice

Robert E. Tarjan, Renato F. Werneck
2009 ACM Journal of Experimental Algorithmics  
We perform an experimental comparison of several versions of dynamic trees: ST-trees, ET-trees, RC-trees, and two variants of top trees (self-adjusting and worst-case).  ...  The best overall performance, however, is achieved by self-adjusting ST-trees.  ...  Self-adjusting top trees are slower than ST-trees by a factor of up to four, but often much less.  ... 
doi:10.1145/1498698.1594231 fatcat:bt4xvqowrfb67n5xbkg2cebbai

Dynamic Trees [chapter]

Renato F. Werneck
2008 Encyclopedia of Algorithms  
For random sequences of links and cuts, splay-based ST-trees are the fastest alternative, followed by splaybased ET-trees, self-adjusting top trees, worst-case top trees, and RC-trees.  ...  Tarjan and Werneck [16] have also introduced self-adjusting top trees, a more efficient implementation of top trees based on path decomposition: it partitions the input forest into edge-disjoint paths  ... 
doi:10.1007/978-0-387-30162-4_121 fatcat:c4r74lxysrdz3gqttv7vyelh6q

Self-Adjusting Heaps

Daniel Dominic Sleator, Robert Endre Tarjan
1986 SIAM journal on computing (Print)  
Instead, during each access or update operation we adjust the data structure in a simple, uniform way. We call such a data structure self-adjusting.  ...  In this paper we develop the skew heap, a self-adjusting form of heap related to the leftist heaps of Crane and Knuth.  ...  This paper represents only a part of our work on amortized complexity and self-adjusting data structures; companion papers discuss self-adjusting lists [ 121 and self-adjusting search trees [13).  ... 
doi:10.1137/0215004 fatcat:knkabl62brcvjdsesgqiqhqwzu

The CB tree: a practical concurrent self-adjusting search tree

Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert E. Tarjan
2014 Distributed computing  
We present the CBTree, a new counting-based self-adjusting binary search tree that, like splay trees, moves more frequently accessed nodes closer to the root.  ...  In contrast to the traditional self-adjusting splay tree in which each accessed item is moved to the root through a sequence of tree rotations, the CBTree performs rotations infrequently (an amortized  ...  Unlike these BSTs, sequential self-adjusting trees do not lend themselves to an efficient concurrent implementation.  ... 
doi:10.1007/s00446-014-0229-0 fatcat:d4cm4p2zmbdqdcfmqq5xcnftui

CBTree: A Practical Concurrent Self-Adjusting Search Tree [chapter]

Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert E. Tarjan
2012 Lecture Notes in Computer Science  
We present the CBTree, a new counting-based self-adjusting binary search tree that, like splay trees, moves more frequently accessed nodes closer to the root.  ...  In contrast to the traditional self-adjusting splay tree in which each accessed item is moved to the root through a sequence of tree rotations, the CBTree performs rotations infrequently (an amortized  ...  Unlike these BSTs, sequential self-adjusting trees do not lend themselves to an efficient concurrent implementation.  ... 
doi:10.1007/978-3-642-33651-5_1 fatcat:gsno6zdxfrhtvnsku4c3jlw5zu

Self‐adjusting trees in practice for large text collections

Hugh E. Williams, Justin Zobel, Steffen Heinz
2001 Software, Practice & Experience  
Splay and randomised search trees are self-balancing binary tree structures with little or no space overhead compared to a standard binary search tree.  ...  Surprisingly, unmodified splaying and randomised search trees are on average around 25% slower than using a standard binary tree.  ...  in a particular news item, and a self-adjusting tree should adjust to such local properties.  ... 
doi:10.1002/spe.394 fatcat:v25hj5pjjrbzfmi2ajmn4w723m

Continuous Canopy Shake Mechanical Harvesting Systems

Stephen H. Futch, Fritz M. Roka
1969 EDIS  
Trees should be topped to a height of no more than 18 feet.  ...  For maximum efficiency, the self-propelled shake and catch units are best suited for groves with uniform tree canopy size. Canopy uniformity can be facilitated by hedging and topping.  ... 
doi:10.32473/edis-hs239-2005 fatcat:3sjgugyai5hw5icunl7gclqfpq

A Novel Advanced Heap Corruption and Security Method [article]

Arundhati Walia, Syed i. Ahson
2012 arXiv   pre-print
A self adjusting binary tree structure is reviewed in the paper, moreover major security issue to secure heap area is also suggested in the paper  ...  When memory is required dynamically during runtime, the SysVmalloc acts as a memory allocator.Vmalloc allocates the chunks of memory in the form of splay tree structure.  ...  Section 2 describes the Vmalloc's function for memory allocation and self adjusting tree structure.  ... 
arXiv:1206.1406v1 fatcat:b7wdlym42jcb7onmofczuaf32m

Brief Announcement: Distributed SplayNets

Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin, Marc Herbstritt
2017 International Symposium on Distributed Computing  
SplayNets are reconfigurable networks which adjust to the communication pattern over time. We present DiSplayNets, a distributed (concurrent and decentralized) implementation of SplayNets.  ...  Introduction SplayNets [3] are locally-routable tree networks whose topology self-adjusts to the workload: nodes communicating more frequently become topologically closer to each other over time.  ...  DiSplayNets self-adjust to the communication pattern in a fully-decentralized manner, eventually serving all communication requests (in a starvation-and deadlock-free manner). 58:2 Distributed SplayNets  ... 
doi:10.4230/lipics.disc.2017.58 dblp:conf/wdag/PeresGSA17 fatcat:wjohtww4pzf63acrpfpcakpc4u

Domain Adaptation for Dependency Parsing via Self-Training

Juntao Yu, Mohab Elkaref, Bernd Bohnet
2015 Proceedings of the 14th International Conference on Parsing Technologies  
The second method calculates the score differences between the best tree and alternative trees.  ...  For the three web domains, no positive results for self-training have been reported before.  ...  The accuracy of the 10% top ranked sentences are lower.  ... 
doi:10.18653/v1/w15-2201 dblp:conf/iwpt/YuEB15 fatcat:poy6w2srhrcmdh3peosn2m4oly

Design of Self-Adjusting algorithm for Twitter Sentiment Analysis

Mr. Amin Nazir Nagiwale, Mr. Manish R. Umale, Mr. Aditya Kumar Sinha
2016 International Journal of Engineering Research and  
overcome these problems we have proposed Selfie,Selfadjusting algorithm in [12] .In this paper we have discussed preparing domain -specific corpus according to change in trends in real time by using self-adjusting  ...  We have implemented Splay tree with trends as tree node and trends near to root of the tree are the most talked/tweeted trends.  ...  A splay tree is a self-adjusting binary search tree with the additional property called splaying.  ... 
doi:10.17577/ijertv5is020023 fatcat:ordixxi4gvbfdk7zox75m24bhu

Fagacées: a tree-centered growth and yield model for sessile oak (Quercus petraea L.) and common beech (Fagus sylvatica L.)

Gilles Le Moguédec, Jean-François Dhôte
2011 Annals of Forest Science  
The trees grow with self-thinning as the only cause of mortality.  ...  In particular, it is necessary that part of the stands used to adjust the relation is close from the self-thinning situation.  ... 
doi:10.1007/s13595-011-0157-0 fatcat:2f5dmsvlxfgjzhydlzkpmwan3q

Minimizing Labeling Effort for Tree Skeleton Segmentation using an Automated Iterative Training Methodology [article]

Keenan Granland, Rhys Newbury, David Ting, Chao Chen
2021 arXiv   pre-print
Using the application of detecting partially occluded apple tree segmentation, we compare manually labeled annotations, self-training, human-in-the-loop, and Automating-the-Loop methods in both the quality  ...  This aims to replicate the manual adjustments of the human-in-the-loop method with an automated process, hence, drastically reducing labeling effort.  ...  Figure 1 : 1 Examples of RGB image of a tree (top row) and the corresponding manually labeled data (bottom row).  ... 
arXiv:2010.08296v3 fatcat:cvtnl7pnvnejvbtswiahuv2y4i
« Previous Showing results 1 — 15 out of 129,790 results