157 search results - page 14 / 32 » Compact representations of separable graphs |
VRST
1997
ACM
13 years 11 months ago
1997
ACM
Abstract. We present an approach for modeling and realtime rendering of outdoor scenes, for use in virtual reality applications such as flight simulators and multi-user virtual env...
STRINGOLOGY
2008
13 years 8 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
CCE
2006
13 years 7 months ago
2006
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
COMBINATORICS
2007
13 years 7 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
AFPAC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Most of the processing in vision today uses spatially invariant operations. This gives efficient and compact computing structures, with the conventional convenient separa...