Sciweavers

3868 search results - page 756 / 774
» A Distributed Parallel Programming Framework
Sort
View
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 10 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
EUROSYS
2009
ACM
14 years 7 months ago
Dingo: taming device drivers
Device drivers are notorious for being a major source of failure in operating systems. In analysing a sample of real defects in Linux drivers, we found that a large proportion (39...
Leonid Ryzhyk, Peter Chubb, Ihor Kuz, Gernot Heise...
VEE
2005
ACM
199views Virtualization» more  VEE 2005»
14 years 3 months ago
Escape analysis in the context of dynamic compilation and deoptimization
In object-oriented programming languages, an object is said to escape the method or thread in which it was created if it can also be accessed by other methods or threads. Knowing ...
Thomas Kotzmann, Hanspeter Mössenböck
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
AIPS
2009
13 years 11 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...