16188 search results - page 3125 / 3238 » The Optimal PAC Algorithm |
EGH
2010
Springer
13 years 8 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
EMSOFT
2010
Springer
13 years 8 months ago
2010
Springer
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
SSDBM
2010
IEEE
13 years 8 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
ICCAD
2009
IEEE
13 years 7 months ago
2009
IEEE
Decoupling capacitance (decap) is an efficient way to reduce transient noise in on-chip power supply networks. However, excessive decap may cause more leakage power, chip resource...
CGF
2010
13 years 7 months ago
2010
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...