Sökning: "scalability improvement"

Visar resultat 6 - 10 av 21 avhandlingar innehållade orden scalability improvement.

  1. 6. Graph Algorithms for Large-Scale and Dynamic Natural Language Processing

    Författare :Kambiz Ghoorchian; Magnus Boman; Magnus Sahlgren; Sumithra Velupillai; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Natural Language Processing; Lexical Disambiguation; Topic Modeling; Representation Learning; Graph Partitioning; Distributed Algorithms; Dimensionality Reduction; Random Indexing; ;

    Sammanfattning : In Natural Language Processing, researchers design and develop algorithms to enable machines to understand and analyze human language. These algorithms benefit multiple downstream applications including sentiment analysis, automatic translation, automatic question answering, and text summarization. LÄS MER

  3. 7. Processes and Models for Capacity Requirements in Telecommunication Systems

    Författare :Andreas Borg; Kristian Sandahl; Martin Glinz; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Sammanfattning : Capacity is an essential quality factor in telecommunication systems. The ability to develop systems with the lowest cost per subscriber and transaction, that also meet the highest availability requirements and at the same time allow for scalability, is a true challenge for a telecommunication systems provider. LÄS MER

  4. 8. Integrated Register Allocation and Instruction Scheduling with Constraint Programming

    Författare :Roberto Castañeda Lozano; Christian Schulte; Mats Carlsson; Ingo Sander; Peter van Beek; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    Sammanfattning : This dissertation proposes a combinatorial model, program representations, and constraint solving techniques for integrated register allocation and instruction scheduling in compiler back-ends. In contrast to traditional compilers based on heuristics, the proposed approach generates potentially optimal code by considering all trade-offs between interdependent decisions as a single optimization problem. LÄS MER

  5. 9. Mining Big and Fast Data: Algorithms and Optimizations for Real-Time Data Processing

    Författare :Muhammad Anis Uddin Nasir; Sarunas Girdzijauskas; Marta Patino-Martinez; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Stream Processing; Load Balancing; Fully Dynamic Graphs; Real-Time Data Processing; Top-k Densest Subgraph; Frequent Subgraph Mining; Informations- och kommunikationsteknik; Information and Communication Technology; Computer Science; Datalogi;

    Sammanfattning : In the last decade, real-time data processing has attracted much attention from both academic community and industry, as the meaning of big data has evolved to incorporate as well the speed of data. The massive and rapid production of data comes via numerous services, i.e., Web, social networks, Internet of Things (IoT) and mobile devices. LÄS MER

  7. 10. Handling Combinatorial Explosion in Software Testing

    Författare :Mats Grindal; Sten Andler; Yu Lei; Högskolan i Skövde; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Input parameter models; software development; software testing; test process; Software engineering; Programvaruteknik; Technology; Teknik; Computer science;

    Sammanfattning : In this thesis, the overall conclusion is that combination strategies, (i.e., test case selection methods that manage the combinatorial explosion of possible things to test), can improve the software testing in most organizations. The research underlying this thesis emphasizes relevance by working in close relationship with industry. LÄS MER