Sciweavers

76 search results - page 2 / 16
» Fast approximation of convex hull
Sort
View
ICIP
2000
IEEE
14 years 5 months ago
Approximately Optimal Assignment for Unequal Loss Protection
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...
WAOA
2007
Springer
132views Algorithms» more  WAOA 2007»
13 years 9 months ago
Approximating Largest Convex Hulls for Imprecise Points
Maarten Löffler, Marc J. van Kreveld
PICS
2003
13 years 5 months ago
Color Gamut Characterization Via Ray Tracing for Device Profile Generation
Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achiev...
Dmitri A. Gusev
ESANN
2001
13 years 5 months ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron
COLT
2010
Springer
13 years 1 months ago
Sparse Recovery in Convex Hulls of Infinite Dictionaries
Let S be an arbitrary measurable space, T R and (X, Y ) be a random couple in S
Vladimir Koltchinskii, Stas Minsker