1458 search results - page 178 / 292 » Monads for incremental computing |
139
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
231
Voted
GIS
2007
ACM
16 years 4 months ago
2007
ACM
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
143
click to vote
SAC
2005
ACM
15 years 9 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
143
Voted
EGH
2007
Springer
15 years 10 months ago
2007
Springer
Logarithmic shadow maps can deliver the same quality as competing shadow map algorithms with substantially less storage and bandwidth. We show how current GPU architectures can be...
194
click to vote
SIGGRAPH
1994
ACM
15 years 7 months ago
1994
ACM
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...