Results 201 to 210 of about 6,641,323 (292)

Learning-based orchestration for low-latency AI deployment in hybrid cloud-edge platforms. [PDF]

Sci Rep
Albugmi A.
europepmc   +1 more source

Differentiable Randers‐Finsler Eikonal Solvers

Computer Graphics Forum, EarlyView.
Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan, Jacob Shpund, Alex M. Bronstein   +2 more
wiley   +1 more source

Novel control strategies for electric vehicle charging stations using stochastic modeling and queueing analysis. [PDF]

Sci Rep
Varshney S, Panda KP, Shah M, Srinivas BA, Deshmukh A, Choudhary KK, Bajaj M, Prokop L, Rubanenko O.   +8 more
europepmc   +1 more source

Scalable Computation of Topological Abstractions for Scalar Data

Computer Graphics Forum, EarlyView.
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, J. Lukasczyk, J. Tierny, A. Gyulassy, G. H. Weber, H. Carr, C. Garth   +6 more
wiley   +1 more source

Stochastic modelling of delays and buffering in 5G-IoT ecosystems with programmable P4 switches based on BMAP. [PDF]

PLoS One
Kovtun V, Yukhimchuk M, Alsayaydeh JAJ, Berdysheva D.   +3 more
europepmc   +1 more source

Progressive Convex Hull Simplification

Computer Graphics Forum, EarlyView.
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

A dynamic light image enhancement algorithm using generative adversarial network for group activity recognition. [PDF]

Sci Rep
Chui KT, Gupta BB, Torres-Ruiz M, Arya V.   +3 more
europepmc   +1 more source

A practical algorithm for weighted k‐hulls

Computer Graphics Forum, EarlyView.
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

Edge Server Selection with Round-Robin-Based Task Processing in Multiserver Mobile Edge Computing. [PDF]

Sensors (Basel)
Aljobory K, Yazici MA.
europepmc   +1 more source

CuRast: Cuda‐Based Software Rasterization for Billions of Triangles

Computer Graphics Forum, EarlyView.
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, L. Lipp, E. Kristmann, M. Wimmer   +3 more
wiley   +1 more source