Sciweavers

7150 search results - page 1176 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ATAL
2011
Springer
14 years 6 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
15 years 8 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
SIAMSC
2008
168views more  SIAMSC 2008»
15 years 6 months ago
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
Siegfried M. Rump, Takeshi Ogita, Shin'ichi Oishi
CVPR
2009
IEEE
17 years 1 months ago
Automated Feature Extraction for Early Detection of Diabetic Retinopathy in Fundus Images
Automated detection of lesions in retinal images can assist in early diagnosis and screening of a common disease: Diabetic Retinopathy. A robust and computationally efficient ap...
Saiprasad Ravishankar (University of Illinois Urba...
CVPR
2009
IEEE
17 years 1 months ago
On Compositional Image Alignment with an Application to Active Appearance Models
Efficient and accurate fitting of Active Appearance Models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is Inverse Compositional ...
Brian Amberg (University of Basel), Andrew Blake (...
« Prev « First page 1176 / 1430 Last » Next »