1034 search results - page 83 / 207 » Wide Classes |
STACS
2000
Springer
14 years 10 days ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
VISUALIZATION
1995
IEEE
14 years 9 days ago
1995
IEEE
Maximum projection is a volume rendering technique that, for each pixel, finds the maximum intensity along a projector. For certain important classes of data, this is an approxim...
SCA
2007
13 years 11 months ago
2007
Hinge-based bending models are widely used in the physically-based animation of cloth, thin plates and shells. We propose a hinge-based model that is simpler to implement, more ef...
AAAI
2007
13 years 11 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
AISB
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...