Sciweavers

1218 search results - page 145 / 244
» The many facets of natural computing
Sort
View
CGF
2008
122views more  CGF 2008»
15 years 6 months ago
Accurate Shadows by Depth Complexity Sampling
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...
Vincent Forest, Loïc Barthe, Mathias Paulin
CORR
2008
Springer
137views Education» more  CORR 2008»
15 years 6 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...
IJAC
2008
84views more  IJAC 2008»
15 years 6 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees
IDA
2006
Springer
15 years 6 months ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan
JAL
2008
74views more  JAL 2008»
15 years 6 months ago
Solving satisfiability in the tile assembly model with a constant-size tileset
Biological systems are far more complex and robust than systems we can engineer today. One way to increase the complexity and robustness of our engineered systems is to study how ...
Yuriy Brun