JCIT
2007
14 years 14 days ago
2007
Usually, in image processing, edge detectors are mostly used as a basis for high level processing. In many cases, the edge detection gives erroneous and imprecise results, as inco...
TCSV
2008
14 years 15 days ago
2008
Edge is an important feature in video classification which finds applications in video representation and coding. In H.264/AVC, intra-prediction mode decision (a computationally in...
TCS
2008
14 years 15 days ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
IPL
2007
14 years 15 days ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
TCS
2008
14 years 15 days ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
IJON
2007
14 years 15 days ago
2007
Although the role of lateral inhibition in edge (contrast) enhancement is well known, it has not been parametrized. This paper investigates the imbalance between the lateral inhib...
SMA
2008
ACM
14 years 15 days ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
GC
2007
Springer
14 years 16 days ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
DAM
2007
14 years 16 days ago
2007
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
CPC
2007
14 years 17 days ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...