Texture fetches often make up a large fraction of total graphics accelerator bandwidth, so there is great interest in methods of compressing textures for real-time decode during rendering [Akenine-Mller and Strm 2003]. These methods typically partition the image into fixed-size blocks, and encode...
Andreas DressBielefeld UniversityFlorian LucaBielefeld UniversitySpringer Berlin HeidelbergDress, A., Luca, F., Unbounded Integer Sequences (An)n≥0 with An+1An-1 -A2n Bounded are of Fibonacci Type, to appear in the Proceedings of AL- COMA99....
Let x/2 denote the integer division by 2. Let odd(x) denote 1 if x is odd, 0 otherwise. Let inc(x,y) denote x+y−odd(x). Then inc(x,1) is the function that moves x to the closest odd number (including itself), and inc(x,2) is the function that moves x to the closes...
Since M never uses more than p(|x|) space on input x, our encoding is well defined for all configurations appearing in the execution of M on x. So M accepts input x if and only if from sx one reaches the configuration tx by a sequence of transitions. Such a transition corresponds ...
Abstract For anym≥ 1, letHmdenote the quantity. A celebrated recent result of Zhang showed the finiteness ofH1, with the explicit boundH1≤70,000,000. This was then improved by us (the Polymath8 project) toH1≤4680, and then by Maynard toH1≤600, who also established for the first ...
IntD=floor(mn);# integer part of conversion ratio FracD=remainder(mn,1);# fractional part of conversion ratio Int_reg = IntD + 1;# register for input sample count to trigger output calculation frac_reg = 0;# register for output sample time instant ...
Multi-Pushdown Games Intuitively, a phase is a sequence of actions in a run during which only one fixed "active" stack can be read (i.e., either make a pop transition or a zero-test transition), but push and internal transitions are unrestricted. There are no other constraints on the ...
Let n, b and c be positive integers with b c and let A = a iini = 0 n be a sequence of integers such that 0 = a 0 < a 1 <…< a n and a i + b a i + c for all i with 0 i n b. We find all n function of b, c and k, k a positive integer, so that all ...
(local)registers. We assume w.l.o.g. that the sets of registers of the different processes are disjoint, and define{\mathcal R}:=\cup _p{\mathcal R}\left( p\right). The code of each processp\in \mathcal Pstarts by declaring a set of registers followed by a sequence of ...
Regardless of whether 𝛿𝑎𝑥𝑖𝑠δaxis or 𝛿𝐿2δL2 is used, EB-HC merges nearby integer coordinates into fewer unique values, then compresses those representative values (and mapping information) via Huffman coding. Because EB-HC relies on dimension-wise or cluster-based merging (ra...