Sciweavers

11231 search results - page 2238 / 2247
» Digging for Data Structures
Sort
View
TSE
2010
118views more  TSE 2010»
15 years 21 days ago
Exception Handling Patterns for Process Modeling
—Process modeling allows for analysis and improvement of processes that coordinate multiple people and tools working together to carry out a task. Process modeling typically focu...
Barbara Staudt Lerner, Stefan Christov, Leon J. Os...
DLOG
2010
15 years 10 days ago
TBox Classification in Parallel: Design and First Evaluation
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...
Mina Aslani, Volker Haarslev
EGH
2010
Springer
15 years 10 days ago
Parallel SAH k-D tree construction
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...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
198
Voted
FOCS
2010
IEEE
15 years 10 days ago
Boosting and Differential Privacy
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...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
GLOBECOM
2010
IEEE
15 years 9 days ago
Cognitive Network Inference through Bayesian Network Analysis
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 ...
Giorgio Quer, Hemanth Meenakshisundaram, Tamma Bhe...
« Prev « First page 2238 / 2247 Last » Next »