2681 search results - page 140 / 537 » Problem F |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper describes an optimization framework for reconstructing nonnegative image intensities from linear projections contaminated with Poisson noise. Such Poisson inverse probl...
CAIP
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We address the problem of jointly estimating the scene illumination, the radiometric camera calibration and the reflectance properties of an object using a set of images...
HICSS
1998
IEEE
14 years 2 months ago
1998
IEEE
Improvements in computer network infrastructures and information utilities have led to an increase in the number of social and work interactions carried out `virtually' by ge...
APPROX
2006
Springer
14 years 2 months ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...