Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ganesh Subbarayan

dblp:94/3527 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-0462-1130ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 1 since 2021Systems, architecture and hardware · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 44% Electronic design automation · 44% Hardware accelerators and domain-specific architectures · 13%
Computer graphics and multimedia
5 papers
Geometric modeling and processing · 95% Computational photography and imaging · 4% Image and video processing · 1%

Topics — the 11 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
design space exploration
0.912025
Real-Time 3-D Thermal Simulation of Advanced Packages via Generative Adversarial Networks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
Performance modeling and evaluation › simulation
thermal simulation
0.912025
Real-Time 3-D Thermal Simulation of Advanced Packages via Generative Adversarial Networks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2025
Geometric modeling and processing
implicit surface
0.622021
Improved Dixon Resultant for Generating Signed Algebraic Level Sets and Algebraic Boolean Operations on Closed Parametric Surfaces · Comput. Aided Des. 2021
Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD-CAE integration · Comput. Aided Des. 2017
Geometric modeling and processing
isogeometric analysis
0.522017
Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD-CAE integration · Comput. Aided Des. 2017
HiGeoM: A symbolic framework for a unified function space representation of trivariate solids for isogeometric analysis · Comput. Aided Des. 2015
Geometric modeling and processing › computer-aided design › CAD integration
CAD-CAE integration
0.312017
Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD-CAE integration · Comput. Aided Des. 2017
Geometric modeling and processing › solid modeling
boolean operations
0.112021
Improved Dixon Resultant for Generating Signed Algebraic Level Sets and Algebraic Boolean Operations on Closed Parametric Surfaces · Comput. Aided Des. 2021
Geometric modeling and processing › solid modeling
constructive solid geometry
0.012004
Constructive solid analysis: a hierarchical, geometry-based meshless analysis procedure for integrated design and analysis · Comput. Aided Des. 2004
Geometric modeling and processing
solid modeling
0.012004
Constructive solid analysis: a hierarchical, geometry-based meshless analysis procedure for integrated design and analysis · Comput. Aided Des. 2004
Computational photography and imaging › color science
color management
0.012002
Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management · ACM Trans. Graph. 2002
Computational photography and imaging › color science › color management
printer color management
0.012002
Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management · ACM Trans. Graph. 2002
Image and video processing › color image processing
color space transformation
0.012002
Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management · ACM Trans. Graph. 2002

Methods — techniques the papers use, named apart from their topics

u-net · 0.9image-to-image translation · 0.9generative adversarial network · 0.9dixon resultant · 0.5boolean composition · 0.3NURBS · 0.3tetrahedral interpolation · 0.0pareto optimization · 0.0artificial neural network · 0.0
YearPublicationVenuePosition
2025 Real-Time 3-D Thermal Simulation of Advanced Packages via Generative Adversarial Networks
abstract
Thermal optimization plays a crucial role in the design of advanced systems in package. Due to the large number of thermal simulations needed for full design space exploration, reductions in simulation run-time are critical. Here, we propose a data-driven approach to physics simulation by using neural networks (NNs) to cast the temperature solution process into an image-to-image translation problem. We first model the power generation map, conductivity map, and boundary conditions (BCs) into separate channels of an image. We then generate temperature solutions by training a generative adversarial network, composed of a U-Net shaped generator and a discriminator. The resultant NN model can handle diverse thermal simulation scenarios with accuracy. More importantly, our model can handle BCs, power maps, and physical package designs which are unseen during the training. Experiments show that speed wise, it enables near real-time design, providing a$2581\times $and$9171\times $speedup over a custom sparse matrix optimized finite element method and ABAQUS, respectively. Comparisons with state-of-the-art methods have demonstrated the accuracy, efficiency, and versatility of the proposed work.
Seunghyun Hwang, Michael Joseph Smith, Vinicius C. Do Nascimento, Qiang Qiu 0001, Cheng-Kok Koh, Ganesh Subbarayan, Dan Jiao
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.6
2021 Improved Dixon Resultant for Generating Signed Algebraic Level Sets and Algebraic Boolean Operations on Closed Parametric Surfaces
Pavan Kumar Vaitheeswaran, Ganesh Subbarayan
Comput. Aided Des.2
2017 Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD-CAE integration
Kritika Upreti, Ganesh Subbarayan
Comput. Aided Des.2
2015 HiGeoM: A symbolic framework for a unified function space representation of trivariate solids for isogeometric analysis
O. T. Morgan, Kritika Upreti, Ganesh Subbarayan, David C. Anderson
Comput. Aided Des.3
2014 A TSV-cross-link-based approach to 3D-clock network synthesis for improved robustness
abstract
To obtain high yield for 3D ICs, random open defects, process variations, and thermal induced stress are key issues that must be addressed when synthesizing 3D clock networks. Current research on 3D clock synthesis often focuses on the construction and optimization of a 3D clock tree topology. Moreover, extra circuitry has been proposed to enable pre-bond testing and substitution of through silicon vias (TSVs) with random open defects. However, tree structures inherently have limited robustness to variations and may suffer failures arising from defects and/or process variations. To counter such problems, we propose to use TSVs to add redundancy in a 3D clock network. The proposed 3D network would have a complete 2D clock network on each die, facilitating pre-bond testing. Also, cross links would be inserted within each die using wires and across dies using TSVs to improve timing robustness within each die and across dies, respectively. Moreover, clock buffers are placed outside of zones that have high TSV-induced stress that could influence carrier mobility. Experimental results show that the proposed 3D clock networks have no failures due to random open defects, and on the average have 53% lower skew compared to 3D tree structures.
Rickard Ewetz, Anirudh Udupa, Ganesh Subbarayan, Cheng-Kok Koh
ACM Great Lakes Symposium on VLSI3
2004 Constructive solid analysis: a hierarchical, geometry-based meshless analysis procedure for integrated design and analysis
Devendra Natekar, Ganesh Subbarayan
Comput. Aided Des.3
2002 Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management
abstract
Color management for the printing of digital images is a challenging task, due primarily to nonlinear ink-mixing behavior and the presence of redundant solutions for print devices with more than three inks. Algorithms for the conversion of image data to printer-specific format are typically designed to achieve a single predetermined rendering intent, such as colorimetric accuracy. In the present paper we present two CIELAB to CMYK color conversion schemes based on a general Pareto-optimal formulation for printer color management. The schemes operate using a 149-color characterization data set selected to efficiently capture the entire CMYK gamut. The first scheme uses artificial neural networks as transfer functions between the CIELAB and CMYK spaces. The second scheme is based on a reformulation of tetrahedral interpolation as an optimization problem. Characterization data are divided into tetrahedra for the interpolation-based approach using the program Qhull, which removes the common restriction that characterization data be well organized. Both schemes offer user control over trade-off problems such as cost versus reproduction accuracy, allowing for user-specified print objectives and the use of constraints such as maximum allowable ink and maximum allowable ΔE*ab. A formulation for minimization of ink is shown to be particularly favorable, integrating both clipping and gamut compression features into a single methodology. Codes developed as applications of these schemes were used to convert several CIELAB Tiff images to CMYK format, providing both qualitative and quantitative verification of the Pareto-optimal approach. Prints of the MacBeth ColorCheckertmchart were accurate within approximately to 3 ΔE*abfor in-gamut colors. Modifications to this approach are presented that offer user control over grey component replacement and provide additional options for rendering intent.
David J. Littlewood, P. A. Drakopoulos, Ganesh Subbarayan
ACM Trans. Graph.3