2902 search results - page 314 / 581 » Simple Local Models for Complex Dynamical Systems |
137
click to vote
JGTOOLS
2008
15 years 3 months ago
2008
Abstract. We explore the implications of reversing the process of shadow computation for real-time applications that model complex reflectance and lighting (such as that specified ...
130
click to vote
ACTA
2007
15 years 3 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
141
Voted
AIPS
2008
15 years 5 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
161
click to vote
AUTOMATICA
2008
15 years 3 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
166
click to vote
TIT
2010
14 years 10 months ago
2010
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...