Sciweavers

3356 search results - page 135 / 672
» Determining Consensus Numbers
Sort
View
DCG
2002
76views more  DCG 2002»
13 years 10 months ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
JAMDS
2002
65views more  JAMDS 2002»
13 years 9 months ago
Optimum workforce scheduling under the (14, 21) days-off timetable
Abstract. An efficient optimum solution is presented for a real-life employee daysoff scheduling problem with a three-week cycle. Over a given work cycle, each worker is given 14 s...
Hesham K. Alfares
COMGEO
2008
ACM
13 years 9 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff
IJCV
2008
172views more  IJCV 2008»
13 years 9 months ago
Nonparametric Bayesian Image Segmentation
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
Peter Orbanz, Joachim M. Buhmann
JGT
2010
103views more  JGT 2010»
13 years 8 months ago
Characterizing 3-connected planar graphs and graphic matroids
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
Manoel Lemos, Talmage James Reid, Haidong Wu