Essays about: "tree traversal"

Showing result 1 - 5 of 7 essays containing the words tree traversal.

  1. 1. Visualizing Carrier Aggregation Combinations

    University essay from Linköpings universitet/Kommunikationssystem

    Author : Fredrik Helders; [2019]
    Keywords : LTE; Carrier Aggregation; Visualization; Graph traversal; Load balancing; 4G; 3GPP;

    Abstract : As wireless communications is becoming an increasingly important part of ourevery day lives, the amount of transmitted data is constantly growing, creating ademand for ever-increasing data rates. One of the technologies used for boostingdata rates is carrier aggregation, which allows for wireless units to combine multipleconnections to the cellular network. READ MORE

  3. 2. Using Hash Trees for Database Schema Inconsistency Detection

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Charlotta Spik; [2019]
    Keywords : Merkle Tree; Hash Tree; inconsistency detection; Anti-Entropy Repair; replica synchronization; Merkle träd; Hashträd; detektion av inkonsekvenser; Anti-Entropi Reparation; Synkronisering av replikor;

    Abstract : For this work, two algorithms have been developed to improve the performance of the inconsistency detection by using Merkle trees. The first builds a hash tree from a database schema version, and the second compares two hash trees to find where changes have occurred. READ MORE

  4. 3. The Shortcut Index

    University essay from Lunds universitet/Institutionen för datavetenskap

    Author : Anton Persson; [2016]
    Keywords : neo4j; ldbc; B tree; oltp; percent of neighborhood interest; range locality; neighborhood locality; graph database; labeled property graph; graph density; neighborhood density; path index; Technology and Engineering;

    Abstract : With a novel path index design, called the Shortcut Index, we partially solve the problem of executing traversal queries on dense neighborhoods in a graph database. We implement our design on top of the graph database Neo4j but it could be used for any graph database that uses the labeled property graph model. READ MORE

  5. 4. Active learning via Transduction in Regression Forests

    University essay from Blekinge Tekniska Högskola/Institutionen för kreativa teknologier

    Author : Kim Hansson; Erik Hörlin; [2015]
    Keywords : Active learning; Regression; Random Forests; Semi-supervised learning; Transduction;

    Abstract : Context. The amount of training data required to build accurate modelsis a common problem in machine learning. Active learning is a techniquethat tries to reduce the amount of required training data by making activechoices of which training data holds the greatest value.Objectives. READ MORE

  6. 5. Efficient Single State Agents for Computer Go

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : David Flemström; [2014]
    Keywords : ;

    Abstract : When it comes to Computer Go agents, the most common strategy is to traverse the game state tree to find as close to optimal solutions as possible. The goal is to sacrifice performance for a higher result accuracy. Going in the other direction — sacrificing accuracy for performance — is a less explored approach to the problem. READ MORE