Sökning: "KDTREE"

Hittade 3 uppsatser innehållade ordet KDTREE.

  1. 1. Discovering Implant Terms in Medical Records

    Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Oskar Jerdhaf; [2021]
    Nyckelord :AI; Machine Learning; Medical Records; Patient Records; Medical; Record; Electronic Records; Electronic Medical Records; BERT; EMR; Implant Terms; Implants; Term; Terms; Term Discovery; Artificial Intelligence; Word; Similarity; Word Similarity; word-similarity; embeddings; word embeddings; word-embeddings; transformers; KDTREE; BALLTREE; NER; AI; Artificiel Intelligens; Maskininlärning; Patient Journal; Medicinsk Journal; Elektronisk Medicinsk Journal; Termer; BERT; KDTREE; BALLTREE; NER; liknande ord; transformers; EMR;

    Sammanfattning : Implant terms are terms like "pacemaker" which indicate the presence of artifacts in the body of a human. These implant terms are key to determining if a patient can safely undergo Magnetic Resonance Imaging (MRI). LÄS MER

  3. 2. Real-time generation of kd-trees for ray tracing using DirectX 11

    Master-uppsats, Blekinge Tekniska Högskola

    Författare :Martin Säll; Fredrik Cronqvist; [2017]
    Nyckelord :Ray tracing; Kd-tree; acceleration; DirectX 11; compute shader;

    Sammanfattning : Context. Ray tracing has always been a simple but effective way to create a photorealistic scene but at a greater cost when expanding the scene. Recent improvements in GPU and CPU hardware have made ray tracing faster, making more complex scenes possible with the same amount of time needed to process the scene. LÄS MER

  4. 3. A comparison study of Kd-tree, Vp-tree and Octree for storing neuronal morphology data with respect to performance

    Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Marcus Adamsson; Aleksandar Vorkapic; [2016]
    Nyckelord :;

    Sammanfattning : In this thesis we investigated performance of Kdtree, Vptree and Octree for storing neuronal morphology data. Two naive list structures were implemented to compare with the space partition data structures. The performance was measured with different sizes of neuronal networks and different types of test cases. LÄS MER