1387 search results - page 43 / 278 » Convexity in Discrete Space |
JSYML
2007
13 years 9 months ago
2007
Let M = M, +, <, 0, {λ}λ∈D be an ordered vector space over an ordered division ring D, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is defin...
DIMACS
2001
13 years 11 months ago
2001
Abstract. One-degree-of-freedom mechanisms induced by minimum pseudotriangulations with one convex hull edge removed have been recently introduced by the author to solve a family o...
CCCG
2003
13 years 11 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
CIMAGING
2010
13 years 11 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...