5363 search results - page 909 / 1073 » Building the Cerebellum in a Computer |
206
click to vote
PVLDB
2010
15 years 4 months ago
2010
Analysts have marked Event Processing as the most growing segment in enterprise computing during years 2008 and 2009, furthermore, this trend is expected to continue. Many of the ...
191
click to vote
EGH
2010
Springer
15 years 4 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...
199
click to vote
PRIB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
186
click to vote
SSDBM
2010
IEEE
15 years 4 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...
180
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...