1032 search results - page 124 / 207 » Extended Computation Tree Logic |
220
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
170
click to vote
PG
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
181
click to vote
CSR
2008
Springer
15 years 9 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
201
click to vote
AAAI
2011
14 years 7 months ago
2011
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
260
click to vote
EGH
2011
Springer
14 years 7 months ago
2011
Springer
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...