1387 search results - page 37 / 278 » Convexity in Discrete Space |
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
COR
2004
13 years 7 months ago
2004
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
FSS
2006
13 years 7 months ago
2006
We consider the interpolation problem for functions whose range and whose domain both consist of convex or fuzzy subsets of a real Euclidean space. This problem arises in fuzzy co...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
NIPS
2007
13 years 9 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...