11394 search results - page 2268 / 2279 » Self-Organizing Data Structures |
123
Voted
DLOG
2010
15 years 24 days 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...
144
Voted
EGH
2010
Springer
15 years 24 days 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...
201
Voted
FOCS
2010
IEEE
15 years 24 days 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...
165
Voted
GLOBECOM
2010
IEEE
15 years 24 days 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 ...
106
Voted
IPPS
2010
IEEE
15 years 21 days 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 ...