Results 31 to 40 of about 676 (131)
Random Probing Security with Precomputation
Transactions on Cryptographic Hardware and Embedded SystemsAt Eurocrypt 2014, Duc, Dziembowski and Faust proposed the random probing model to bridge the gap between the probing model proposed at Crypto 2003 and the noisy model proposed at Eurocrypt 2013.
Bohan Wang +3 more
doaj +1 more source
A Texture‐Free Multi‐Scale Model for Surface‐Based Rendering of Knitted Fabrics
Computer Graphics Forum, EarlyView.Abstract Knitted fabrics present unique challenges for realistic rendering due to their complicated structure and scale‐dependent appearance. Existing methods typically rely on explicit yarn geometry, which is computationally complex, or texture‐based representations that require heavy storage and precomputed maps. In this paper, we introduce the first
Apoorv Khattar +3 more
wiley +1 more source
First-order query evaluation on structures of bounded degree [PDF]
Logical Methods in Computer Science, 2011 We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved
Wojciech Kazana, Luc Segoufin
doaj +1 more source
Real‐Time Rendering of Dynamic Line Sets using Voxel Ray Tracing
Computer Graphics Forum, EarlyView.Abstract Real‐time rendering of dynamic line sets is relevant in many visualization tasks, including unsteady flow visualization and interactive white matter reconstruction from Magnetic Resonance Imaging. High‐quality global illumination and transparency are important for conveying the spatial structure of dense line sets, yet remain difficult to ...
B. Kraaijeveld +3 more
wiley +1 more source
EliMAC: Speeding Up LightMAC by around 20%
IACR Transactions on Symmetric Cryptology, 2023 Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig +2 more
doaj +1 more source
Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis
Computer Graphics Forum, EarlyView.Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley +1 more source
Research on Physical Reliability Rendering Algorithm
IEEE AccessComputer graphics real-time rendering technology is developing rapidly. During the development process, the requirements for rendering realism and speed are getting higher.
Xingyu Wang, Lingzeng Meng
doaj +1 more source
ETRI Journal, 2023 In this work, we proposed a low-complexity hybrid layered tabu-likelihood ascent search (LTLAS) algorithm for large multiple-input multiple-output (MIMO) system.
Sourav Chakraborty +2 more
doaj +1 more source
Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy
Computer Graphics Forum, EarlyView.Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley +1 more source
Improving the organization and interactivity of metabolic pathfinding with precomputed pathways
BMC Bioinformatics, 2020 Background The rapid growth of available knowledge on metabolic processes across thousands of species continues to expand the possibilities of producing chemicals by combining pathways found in different species.
Sarah M. Kim +4 more
doaj +1 more source