Sciweavers

4539 search results - page 562 / 908
» Approaches to Compute Workflow Complexity
Sort
View
VMV
2004
118views Visualization» more  VMV 2004»
15 years 8 months ago
Contact Handling for Deformable Point-Based Objects
This paper presents an approach to collision detection and response for dynamically deforming pointbased objects. Both the volume of an object and its surface are represented by p...
Richard Keiser, Matthias Müller, Bruno Heidel...
AAAI
1998
15 years 8 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
ACL
1998
15 years 8 months ago
Reference Resolution beyond Coreference: a Conceptual Frame and its Application
A model for reference use in communication is proposed, from a representationist point of view. Both the sender and the receiver of a message handle representations of their commo...
Andrei Popescu-Belis, Isabelle Robba, Gérar...
COLING
2000
15 years 8 months ago
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample
We argue that some of the computational complexity associated with estimation of stochastic attributevalue grammars can be reduced by training upon an informative subset of the fu...
Miles Osborne
GRAPHICSINTERFACE
1998
15 years 8 months ago
Ray-tracing Procedural Displacement Shaders
Displacement maps and procedural displacement shaders are a widely used approach of specifying geometric detail and increasing the visual complexity of a scene. While it is relati...
Wolfgang Heidrich, Hans-Peter Seidel