11394 search results - page 2268 / 2279 » Self-Organizing Data Structures |
113
click to vote
DLOG
2010
14 years 11 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
133
click to vote
EGH
2010
Springer
14 years 11 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...
183
click to vote
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
153
click to vote
GLOBECOM
2010
IEEE
14 years 11 months ago
2010
IEEE
Cognitive networking deals with applying cognition to the entire network protocol stack for achieving stack-wide as well as network-wide performance goals, unlike cognitive radios ...
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...