Sciweavers

1387 search results - page 22 / 278
» Convexity in Discrete Space
Sort
View
TSMC
2008
122views more  TSMC 2008»
13 years 7 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin
COMPGEOM
2008
ACM
13 years 9 months ago
Extremal problems on triangle areas in two and three dimensions
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
ORL
2008
93views more  ORL 2008»
13 years 7 months ago
Polymatroids and mean-risk minimization in discrete optimization
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
Alper Atamtürk, Vishnu Narayanan
COMPGEOM
2000
ACM
13 years 12 months ago
Computing approximate shortest paths on convex polytopes
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
SIAMSC
2008
188views more  SIAMSC 2008»
13 years 7 months ago
Adaptivity with Dynamic Meshes for Space-Time Finite Element Discretizations of Parabolic Equations
In this paper, we develop an error estimator and an adaptive algorithm for efficient solution of parabolic partial differential equations. The error estimator assesses the discreti...
Michael Schmich, Boris Vexler