DM
2002
14 years 7 days ago
2002
We consider the vertex-isoperimetric problem for cartesian powers of a graph G. A total order on the vertex set of G is called isoperimetric if the boundary of sets of a given siz...
DM
2010
14 years 16 days ago
2010
We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the max...
ICIP
2007
IEEE
15 years 2 months ago
2007
IEEE
We propose an extension of the classical morphological filtering based on openings by line segment structuring elements. It consists in filtering a 3D+time image with the opening ...