Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
A pair of rendered images and their Z-buffers contain almost all of the information necessary to re-render from nearby viewpoints. For the small changes in viewpoint that occur in...
A number of problems are well suited for volumetric representation for both simulation and storage, however, the large amount of data that needs to be processed and rendered with ...
Shigeru Muraki, Eric B. Lum, Kwan-Liu Ma, Masato O...
Service-oriented computing is meant to support loose relationships between organisations: Collaboration procedures on the application-level translate to interaction processes via ...
Christian Zirpins, Winfried Lamersdorf, Toby Baier
Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...
Nina Yevtushenko, Tiziano Villa, Robert K. Brayton...