Search Results - "Devkota, Sabin"

Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, (SGD)^(SGD)2 by Ahmed, Reyan, De Luca, Felice, Devkota, Sabin, Kobourov, Stephen, Li, Mingwei

“…Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension…”
Get full text

CFGExplorer: Designing a Visual Control Flow Analytics System around Basic Program Analysis Operations by Devkota, Sabin, Isaacs, Katherine E.

“…To develop new compilation and optimization techniques, computer scientists frequently Consult program analysis artifacts such as Control flow graphs (CFGs)…”
Get full text

Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, [Formula Omitted] by Reyan Ahmed, Felice De Luca, Devkota, Sabin, Kobourov, Stephen, Li, Mingwei

“…Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension…”
Get full text

Visualizing Control Flow Graphs by Devkota, Sabin

“…Control Flow Graphs (CFGs) are directed graphs that represent all possible paths a computer program can take during its execution. They are used to analyze…”
Get full text

CcNav: Understanding Compiler Optimizations in Binary Code by Devkota, Sabin, Aschwanden, Pascal, Kunen, Adam, Legendre, Matthew, Isaacs, Katherine E.

“…Program developers spend significant time on optimizing and tuning programs. During this iterative process, they apply optimizations, analyze the resulting…”
Get full text

Multicriteria Scalable Graph Drawing via Stochastic Gradient Descent, $(SGD)^2 by Ahmed, Reyan, De Luca, Felice, Devkota, Sabin, Kobourov, Stephen, Li, Mingwei

“…Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension…”
Get full text

Domain-Centered Support for Layout, Tasks, and Specification for Control Flow Graph Visualization by Devkota, Sabin, LeGendre, Matthew P., Kunen, Adam, Aschwanden, Pascal, Isaacs, Katherine E.

“…Computing professionals in areas like compilers, performance analysis, and security often analyze and manipulate control flow graphs (CFGs) in their work. CFGs…”
Get full text

Domain-Centered Support for Layout, Tasks, and Specification for Control Flow Graph Visualization by Devkota, Sabin, LeGendre, Matthew P, Kunen, Adam, Aschwanden, Pascal, Isaacs, Katherine E

“…Computing professionals in areas like compilers, performance analysis, and security often analyze and manipulate control flow graphs (CFGs) in their work. CFGs…”
Get full text

CcNav: Understanding Compiler Optimizations in Binary Code by Devkota, Sabin, Aschwanden, Pascal, Kunen, Adam, Legendre, Matthew, Isaacs, Katherine E

“…Program developers spend significant time on optimizing and tuning programs. During this iterative process, they apply optimizations, analyze the resulting…”
Get full text

Graph Drawing via Gradient Descent, $(GD)^2 by Ahmed, Reyan, De Luca, Felice, Devkota, Sabin, Kobourov, Stephen, Li, Mingwei

“…Readability criteria, such as distance or neighborhood preservation, are often used to optimize node-link representations of graphs to enable the comprehension…”
Get full text

Stress-Plus-X (SPX) Graph Layout by Devkota, Sabin, Ahmed, Reyan, De Luca, Felice, Isaacs, Katherine E, Kobourov, Stephen

“…Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms…”
Get full text

L-Graphs and Monotone L-Graphs by Ahmed, Abu Reyan, De Luca, Felice, Devkota, Sabin, Efrat, Alon, Hossain, Md Iqbal, Kobourov, Stephen, Li, Jixian, Salma, Sammi Abida, Welch, Eric

“…In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the…”
Get full text