Sciweavers

697 search results - page 33 / 140
» Convex Functions on Discrete Sets
Sort
View
JAT
2011
93views more  JAT 2011»
13 years 3 months ago
Approximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
Jorge Galindo, Manuel Sanchis
ISIPTA
2003
IEEE
14 years 2 months ago
Expected Utility with Multiple Priors
Let be a preference relation on a convex set F. Necessary and sufficient conditions are given that guarantee the existence of a set {ul} of affine utility functions on F such th...
Erio Castagnoli, Fabio Maccheroni, Massimo Marinac...
CVPR
1996
IEEE
14 years 1 months ago
What is the set of images of an object under all possible lighting conditions?
The appearance of a particular object depends on both the viewpoint from which it is observed and the light sources by which it is illuminated. If the appearance of two objects is...
Peter N. Belhumeur, David J. Kriegman
ACL
2006
13 years 10 months ago
Minimum Risk Annealing for Training Log-Linear Models
When training the parameters for a natural language system, one would prefer to minimize 1-best loss (error) on an evaluation set. Since the error surface for many natural languag...
David A. Smith, Jason Eisner
COMPGEOM
2004
ACM
14 years 2 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue