Sciweavers

20 search results - page 4 / 4
» lics 1997
Sort
View
LICS
1997
IEEE
13 years 9 months ago
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
Martín Hötzel Escardó, Thomas S...
VISUALIZATION
1997
IEEE
13 years 9 months ago
UFLIC: a line integral convolution algorithm for visualizing unsteady flows
This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vectordata in unsteadyflow fields. Using the Line Integral Convolution (LIC) as the underlying method, ...
Han-Wei Shen, David L. Kao
LICS
1997
IEEE
13 years 9 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
LICS
1997
IEEE
13 years 9 months ago
The Complexity of Subtype Entailment for Simple Types
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
Fritz Henglein, Jakob Rehof
LICS
1997
IEEE
13 years 8 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...