Sökning: "search tree."
Visar resultat 1 - 5 av 65 avhandlingar innehållade orden search tree..
1. Lock-free Concurrent Search
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
2. Comparison and Tracking Methods for Interactive Visualization of Topological Structures in Scalar Fields
Sammanfattning : Scalar fields occur quite commonly in several application areas in both static and time-dependent forms. Hence a proper visualization of scalar fieldsneeds to be equipped with tools to extract and focus on important features of the data. LÄS MER
3. Contributions to Semantic Dependency Parsing : Search, Learning, and Application
Sammanfattning : Semantic dependency parsing is the task of mapping natural language sentences into representations of their meaning in the form of directed graphs on words. These bilexical graphs are designed to capture the sentence-internal predicate-argument relationships – they tell us “who did what to whom” in the given sentence. LÄS MER
4. The Search for Syntax : Investigating the Syntactic Knowledge of Neural Language Models Through the Lens of Dependency Parsing
Sammanfattning : Syntax — the study of the hierarchical structure of language — has long featured as a prominent research topic in the field of natural language processing (NLP). Traditionally, its role in NLP was confined towards developing parsers: supervised algorithms tasked with predicting the structure of utterances (often for use in downstream applications). LÄS MER
5. Efficient concurrent data structure access parallelism techniques for increasing scalability
Sammanfattning : Multi-core processors have revolutionised the way data structures are designed by bringing parallelism to mainstream computing. Key to exploiting hardware parallelism available in multi-core processors are concurrent data structures. LÄS MER