697 search results - page 5 / 140 » Convex Functions on Discrete Sets |
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
CIMAGING
2010
13 years 10 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
DGCI
2003
Springer
14 years 1 months ago
2003
Springer
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
TCS
2008
13 years 8 months ago
2008
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
DGCI
2006
Springer
13 years 10 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...