Sciweavers

1941 search results - page 142 / 389
» On the Hardness of Approximate Reasoning
Sort
View
WSCG
2004
189views more  WSCG 2004»
15 years 7 months ago
Hardware Accelerated Soft Shadows using Penumbra Quads
Shadow mapping is a commonly used technique for generating hard shadows in real time. However, existing shadow map based algorithms cannot render full soft shadows penumbras onto ...
Jukka Arvo, Jan Westerholm
CG
2006
Springer
15 years 6 months ago
Interactive mesh deformation using equality-constrained least squares
Mesh deformation techniques that preserve the differential properties have been intensively studied. In this paper, we propose an equality-constrained least squares approach for s...
H. Masuda, Y. Yoshioka, Y. Furukawa
POPL
2012
ACM
14 years 2 months ago
Towards a program logic for JavaScript
JavaScript has become the most widely used language for clientside web programming. The dynamic nature of JavaScript makes understanding its code notoriously difficult, leading t...
Philippa Gardner, Sergio Maffeis, Gareth David Smi...
CADE
1998
Springer
15 years 10 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
IJCAI
1989
15 years 7 months ago
A Model for Projection and Action
In designing autonomous agents that deal competently with issues involving time and space, there is a tradeoff to be made between guaranteed response-time reactions on the one han...
Keiji Kanazawa, Thomas Dean