6740 search results - page 353 / 1348 » An s -Hamiltonian Line Graph Problem |
144
click to vote
IJCV
2006
15 years 4 months ago
2006
Consider the problem of image deblurring in the presence of impulsive noise. Standard image deconvolution methods rely on the Gaussian noise model and do not perform well with imp...
133
click to vote
ECCV
1998
Springer
16 years 6 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
112
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
160
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
148
click to vote
COR
2008
15 years 4 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...