243 search results - page 3 / 49 » The Geometry of Strict Maximality |
DIMACS
2001
13 years 7 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...
JSYML
2002
13 years 5 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
WINE
2007
Springer
13 years 12 months ago
2007
Springer
We study sequential auctions for private value objects and unit-demand bidders using second-price sealed-bid rules. We analyze this scenario from the seller’s perspective and con...
ICPP
2002
IEEE
13 years 10 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
FSS
2010
13 years 4 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...