Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Optimization of tray inventory levels in hospitals from an integral perspective. [PDF]
Bos H +4 more
europepmc +1 more source
Cost optimization of a repairable M/G/1 queue with a randomized policy and single vacation
Dong-Yuh Yang, J. Ke
semanticscholar +1 more source
Waiting List Policy Reform Is Required to Enable Randomised Controlled Trials of Elective Surgery
ANZ Journal of Surgery, EarlyView.
Jonathan G. Quicke +6 more
wiley +1 more source
Progressive Convex Hull Simplification
Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley +1 more source
Interpretable Taxi-Out Time Prediction of Departure Flights Using Stacking Ensemble Learning and SHAP Analysis. [PDF]
Wu T +5 more
europepmc +1 more source
A practical algorithm for weighted k‐hulls
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
Research on online EDI order scheduling optimization strategy in manufacturing enterprises based on time-varying Markov chains. [PDF]
Wulan Q.
europepmc +1 more source
CuRast: Cuda‐Based Software Rasterization for Billions of Triangles
Abstract This paper presents a CUDA‐based software rasterizer capable of rendering up to a billion unique triangles, or up to 4 billion instanced triangles, in real time at 60 fps on an RTX 5090. By specifically targeting dense, opaque meshes, our approach is able to outperform the native GPU rasterization pipeline in these scenarios.
M. Schütz +3 more
wiley +1 more source
The Research on a Collaborative Management Model for Multi-Source Heterogeneous Data Based on OPC Communication. [PDF]
Tian J +6 more
europepmc +1 more source

