COCOON
2005
Springer
13 years 10 months ago
2005
Springer
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
RECOMB
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. There have been many widely used genome rearrangement models, such as reversals, HannenhalliPevzner, and double-cut and join. Though each one can be precisely defined, t...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...