Sciweavers

1450 search results - page 131 / 290
» On the Complexity of Hardness Amplification
Sort
View
ICMLA
2008
13 years 10 months ago
Comprehensible Models for Predicting Molecular Interaction with Heart-Regulating Genes
When using machine learning for in silico modeling, the goal is normally to obtain highly accurate predictive models. Often, however, models should also bring insights into intere...
Cecilia Sönströd, Ulf Johansson, Ulf Nor...
WSCG
2004
161views more  WSCG 2004»
13 years 10 months ago
Rendering Techniques for Hardware-Accelerated Image-Based CSG
Image-based CSG rendering algorithms for standard graphics hardware rely on multipass rendering that includes reading and writing large amounts of pixel data from and to the frame...
Florian Kirsch, Jürgen Döllner
HPN
1997
13 years 10 months ago
Mobiware: QoS-aware middleware for mobile multimedia communications
Next generation wireless communications system will be required to support the seamless delivery of voice, video and data with high quality. Delivering hard Quality of Service (QO...
Andrew T. Campbell
GPCE
2008
Springer
13 years 10 months ago
Lightweight dependent classes
Extensive research efforts have been devoted to implement a group of type-safe mutually recursive classes; recently, proposals for separating each member of the group as a reusabl...
Tetsuo Kamina, Tetsuo Tamai
IANDC
2008
122views more  IANDC 2008»
13 years 9 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza