BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Australia/Melbourne
X-LIC-LOCATION:Australia/Melbourne
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19721003T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19721003T020000
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260114T163640Z
LOCATION:Meeting Room C4.8\, Level 4 (Convention Centre)
DTSTART;TZID=Australia/Melbourne:20231215T091500
DTEND;TZID=Australia/Melbourne:20231215T093000
UID:siggraphasia_SIGGRAPH Asia 2023_sess155_papers_127@linklings.com
SUMMARY:ART-Owen Scrambling
DESCRIPTION:Abdalla G. M. Ahmed (KAUST), Matt Pharr (NVIDIA), and Peter Wo
 nka (KAUST)\n\nWe present a novel algorithm for implementing Owen-scrambli
 ng, combining the generation and distribution of the scrambling bits in a 
 single self-contained compact process.\nWe employ a context-free grammar t
 o build a binary tree of symbols, and equip each symbol with a scrambling 
 code that affects all descendant nodes.\nWe nominate the grammar of adapti
 ve regular tiles (ART) derived from the repetition-avoiding Thue-Morse wor
 d, and we discuss its potential advantages and shortcomings.\nOur algorith
 m has many advantages, including random access to samples, fixed time comp
 lexity, GPU friendliness, and scalability to any memory budget.\nFurther, 
 it provides two unique features over known methods: it admits optimization
 , and it is invertable, enabling screen-space scrambling of the high-dimen
 sional Sobol sampler.\n\nRegistration Category: Full Access\n\nSession Cha
 ir: Sing Chun Lee (Bucknell University)\n\n
URL:https://asia.siggraph.org/2023/full-program?id=papers_127&sess=sess155
END:VEVENT
END:VCALENDAR