Skip to search formSkip to main contentSkip to account menu

Swizzling (computer graphics)

Known as: Swizzling 
In computer graphics, swizzling means rearranging the elements of a vector. For example, if A = {1,2,3,4}, where the components are x, y, z, and w… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Most embedded database systems are built on a two-level memory hierarchy, a RAM buffer on top of flash memory. Both kinds of… 
1998
1998
In this paper, we evaluate the effectiveness of basing distributed systems on a persistent globally shared address space… 
1995
1995
Nested transactions facilitate the control of complex persistent applications by enabling both ne-tuning of the scope of rollback… 
1994
1994
E** is a version of the E database programming language which is supported by the Amadeus persistent and distributed platform… 
Review
1993
Review
1993
This is a very preliminary eeort to write a Computing Surveys type paper on algorithms used for memory management. Because this… 
1990
1990
CMPSCI TR 90-38 Working with Persistent Objects: To Swizzle or Not to Swizzle J. Eliot B. Moss May 1990 We have developed an…