1387 search results - page 90 / 278 » Convexity in Discrete Space |
154
click to vote
ISIPTA
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we adopt the geometric approach to the theory of evidence to study the geometric counterparts of the plausibility functions, or upper probabilities. The computation ...
165
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
154
click to vote
COSIT
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. The modeling of concepts from a cognitive perspective is important for designing spatial information systems that interoperate with human users. Concept representations t...
156
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
133
click to vote
DAM
1998
15 years 5 months ago
1998
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...