2060 search results - page 95 / 412 » Some Applications of Coding Theory in Computational Complexi... |
CGF
2008
14 years 10 months ago
2008
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
173
click to vote
AISB
2008
Springer
14 years 11 months ago
2008
Springer
This position paper argues the case for the application of constructivist theories to Artificial Intelligence, with particular emphasis on Piaget's theory. The idea of buildin...
115
click to vote
PODS
1994
ACM
15 years 1 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we present a tool allowing the design of orchestration at a high level of abstraction. This tool also allows specifying security properties, also in an way, as anno...