Sökning: "Binary Search Trees"

Hittade 4 avhandlingar innehållade orden Binary Search Trees.

1. 1. Lock-free Concurrent Search

   Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Wait-free; Help-aware; Non-blocking; Concurrency; Linearizability; Lock-based; Lock-free-kD-tree; Amortized Complexity; Data Structure; Binary Search Tree; Blocking; Search; Concurrent; kD-tree; Linked-list; Lock-free; Range Search; Language-portable; Help-optimal; Nearest Neighbour Search; Linearizable; Synchronization;

   Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER

3. 2. Split Trees, Cuttings and Explosions

   Författare :Cecilia Holmgren; Svante Janson; Luc Devroye; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random Graphs; Random Trees; Split Trees; Renewal Theory; Binary Search Trees; Cuttings; Records; Tree Algorithms; Markov Chains; Galton-Watson Processes; MATHEMATICS; MATEMATIK; Mathematics; Matematik;

   Sammanfattning : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. LÄS MER

4. 3. Random Records and Cuttings in Binary Search Trees

   Författare :Cecilia Holmgren; Svante Janson; Anders Martin-Löf; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Discrete mathematics; Diskret matematik; Mathematics; Matematik;

   Sammanfattning : .... LÄS MER

5. 4. Pattern Recognition with Vector Symbolic Architectures

   Författare :Denis Kleyko; Okko Räsänen; Luleå tekniska universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

   Sammanfattning : Pattern recognition is an area constantly enlarging its theoretical and practical horizons. Applications of pattern recognition and machine learning can be found in many areas of the present day world including health-care, robotics, manufacturing, economics, automation, transportation, etc. LÄS MER