Sciweavers

3415 search results - page 133 / 683
» Lower Bounds for Kernelizations
Sort
View
ASPLOS
2009
ACM
16 years 5 months ago
Maximum benefit from a minimal HTM
A minimal, bounded hardware transactional memory implementation significantly improves synchronization performance when used in an operating system kernel. We add HTM to Linux 2.4...
Owen S. Hofmann, Christopher J. Rossbach, Emmett W...
FOCM
2006
97views more  FOCM 2006»
15 years 4 months ago
Learning Rates of Least-Square Regularized Regression
This paper considers the regularized learning algorithm associated with the leastsquare loss and reproducing kernel Hilbert spaces. The target is the error analysis for the regres...
Qiang Wu, Yiming Ying, Ding-Xuan Zhou
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 11 months ago
A Unifying View of Multiple Kernel Learning
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
Marius Kloft, Ulrich Rückert, Peter L. Bartle...
DSN
2006
IEEE
15 years 10 months ago
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes
This paper provides a technique, based on partially observable Markov decision processes (POMDPs), for building automatic recovery controllers to guide distributed system recovery...
Kaustubh R. Joshi, William H. Sanders, Matti A. Hi...
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 3 months ago
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...