Results 41 to 50 of about 13,771 (177)
Boosting Java Performance Using GPGPUs [PDF]
, 2017 Heterogeneous programming has started becoming the norm in order to achieve better performance by running portions of code on the most appropriate hardware resource. Currently, significant engineering efforts are undertaken in order to enable existing programming languages to perform heterogeneous execution mainly on GPUs.
Clarkson, James +3 more
openaire +2 more sources
Splatshop: Efficiently Editing Large Gaussian Splat Models
Computer Graphics Forum, EarlyView.Abstract We present Splatshop, a highly optimized toolbox for interactive editing (selection, deletion, painting, transformation, …) of 3D Gaussian Splatting models. Utilizing a comprehensive collection of heuristic approaches, we carefully balance between exact and fast rendering to enable precise editing without sacrificing real‐time performance. Our
Markus Schütz +5 more
wiley +1 more source
How General-Purpose can a GPU be?
South African Computer Journal, 2015 The use of graphics processing units (GPUs) in general-purpose computation (GPGPU) is a growing field. GPU instruction sets, while implementing a graphics pipeline, draw from a range of single instruction multiple datastream (SIMD) architectures ...
Philip Machanick
doaj +1 more source
Unphysical Structure Collapse in Quantum Mechanics Calculations With Continuum Solvation
ChemPhysChem, Volume 27, Issue 5, 13 March 2026.Quantum mechanics conformer searches with continuum solvation models yield preferably collapsed conformations not confirmed by sophisticated nuclear magnetic resonance (NMR) experiments. Continuum solvation force‐field and explicit solvation molecular dynamics simulations result preferably in stretched conformations, hinting on general weaknesses of ...
Andreas H. Göller +1 more
wiley +1 more source
Моделирование и анализ информационных систем, 2014 An analysis of numerical optimization methods for solving a problem of molecular docking has been performed. Some additional requirements for optimization methods according to GPU architecture features were specified.
M. A. Farkov, A. I. Legalov
doaj +1 more source
Active Data Structures on GPGPUs [PDF]
, 2014 Active data structures support operations that may affect a large number of elements of an aggregate data structure. They are well suited for extremely fine grain parallel systems, including circuit parallelism. General purpose GPUs were designed to support regular graphics algorithms, but their intermediate level of granularity makes them potentially ...
O'Donnell, J., Hall, C., Monro, S.
openaire +2 more sources
4D spatial–temporal information infrastructure for digital twin environments using Spatial IDs
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 30, Page 6184-6200, 19 December 2025.Abstract Digital twin technologies are gaining global attention as foundational components for data‐driven infrastructure management and urban simulation. However, significant challenges remain in integrating and utilizing geospatial datasets, including inconsistencies in spatial referencing methods, the absence of semantic object identification, and ...
Kenji Nakamura +3 more
wiley +1 more source
Developing a Pattern Discovery Method in Time Series Data and Its GPU Acceleration
Big Data Mining and Analytics, 2018 The Dynamic Time Warping (DTW) algorithm is widely used in finding the global alignment of time series. Many time series data mining and analytical problems can be solved by the DTW algorithm. However, using the DTW algorithm to find similar subsequences
Huanzhou Zhu +5 more
doaj +1 more source
Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque +4 more
wiley +1 more source
Locality-Sensitive Hashing for Information Retrieval System on Multiple GPGPU Devices
Applied Sciences, 2020 It is challenging to build a real-time information retrieval system, especially for systems with high-dimensional big data. To structure big data, many hashing algorithms that map similar data items to the same bucket to advance the search have been ...
Toan Nguyen Mau, Yasushi Inoguchi
doaj +1 more source