Sciweavers

683 search results - page 127 / 137
» Generalization Bounds for Learning Kernels
Sort
View
ICML
2000
IEEE
14 years 8 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
COLT
2006
Springer
13 years 11 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
PPOPP
2009
ACM
14 years 7 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
Tong Li, Dan P. Baumberger, Scott Hahn
EUROSYS
2008
ACM
14 years 4 months ago
Manageable fine-grained information flow
The continuing frequency and seriousness of security incidents underlines the importance of application security. Decentralized information flow control (DIFC), a promising tool ...
Petros Efstathopoulos, Eddie Kohler
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 1 months ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller