Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"call graphs"”.

  1. Software Analytics for Improving Program Comprehension

    … to facilitate program comprehensions, such as call graphs, which represent the system’s structure and its implementation as a directed graph. Furthermore, some studies focused on semantic enrichment of the software system problems using systematic learning analytics, including machine learning …

    umkc Repository record for Software Analytics for Improving Program Comprehension (opens in a new tab)

  2. Combining information retrieval modules and structural information for source code bug localization and feature location

    … combines LSI modeling lexical information and call graphs to modeling structural information. The output is a list of methods ranked in descending order by likelihood of requiring modification to correct the bug or implement the feature under consideration. Three case studies including …

    alabama Repository record for Combining information retrieval modules and structural information for source code bug localization and feature location (opens in a new tab)

  3. Storage and processing systems for power-law graphs

    Large graphs abound around us - online social networks, Web graphs, the Internet, citation networks, protein interaction networks, telephone call graphs, peer-to-peer overlay networks, electric power grid networks, etc. Many real- life graphs are power-law graphs. A fundamental challenge in today’s …

    uiuc Repository record for Storage and processing systems for power-law graphs (opens in a new tab)

  4. A Feature-Based Call Graph Distance Measure for Program Similarity Analysis

    … programs is a complex task. By extracting call graphs (graphs of caller-callee relationships of the program's functions, where nodes denote functions and directed edges denote function calls) from the programs, the similarity measurement can be changed into a graph problem. Previously, …

    helsinki Repository record for A Feature-Based Call Graph Distance Measure for Program Similarity Analysis (opens in a new tab)

  5. Automated End-to-End Management of the Deep Learning Lifecycle

    … named ModelKB. ModelKB can \textit{automatically} manage the modeling lifecycle end-to-end, including (1) monitoring and tracking experiments; (2) visualizing, searching for, and comparing models and experiments; (3) deploying models locally and on the cloud; and (4) sharing and publishing …

    umkc Repository record for Automated End-to-End Management of the Deep Learning Lifecycle (opens in a new tab)

  6. Cloud-aided wireless systems: communications and radar applications

    … This problem is modeled by using application call graphs, and the joint optimization of application-layer and physical-layer parameters is carried out via a message passing algorithm by minimizing the total energy expenditure of the mobile user. The concept of cloud radio is also being …

    njit Repository record for Cloud-aided wireless systems: communications and radar applications (opens in a new tab)

  7. Static Analyses of Interlanguage Interoperations

    … at the same time, it becomes difficult to statically analyze these applications. The amalgamation of two languages in a single application may introduce bugs ranging from type-mismatch to security vulnerabilities. Therefore, it is necessary to develop static analysis techniques to aid developers …

    passau-thes Repository record for Static Analyses of Interlanguage Interoperations (opens in a new tab)

  8. Efficient visual navigation of hierarchically structured graphs

    Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierarchical structure. This structure is expressed in form of a recursive clustering of the nodes: in call graphs of telephone networks, for instance, the nodes …

    passau-thes Repository record for Efficient visual navigation of hierarchically structured graphs (opens in a new tab)