Sciweavers

1034 search results - page 83 / 207
» Wide Classes
Sort
View
101
Voted
STACS
2000
Springer
15 years 6 months ago
The Complexity of Planarity Testing
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...
Eric Allender, Meena Mahajan
121
Voted
VISUALIZATION
1995
IEEE
15 years 6 months ago
Interactive Maximum Projection Volume Rendering
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...
Michael D. McCool, Wolfgang Heidrich, John Stevens
114
Voted
SCA
2007
15 years 5 months ago
Cubic shells
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...
Akash Garg, Eitan Grinspun, Max Wardetzky, Denis Z...
112
Voted
AAAI
2007
15 years 5 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
141
Voted
AISB
2008
Springer
15 years 4 months ago
Substitution for Fraenkel-Mostowski foundations
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...
Murdoch Gabbay, Michael Gabbay