COCOA
2008
Springer
13 years 6 months ago
2008
Springer
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
COMPGEOM
2007
ACM
13 years 6 months ago
2007
ACM
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
COCOA
2007
Springer
13 years 6 months ago
2007
Springer
COCOA
2007
Springer
13 years 6 months ago
2007
Springer
CAAN
2007
Springer
13 years 6 months ago
2007
Springer
DGCI
2006
Springer
13 years 6 months ago
2006
Springer
We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the t...
DGCI
2006
Springer
13 years 6 months ago
2006
Springer
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. In [1], an algorithm which perform...