216 search results - page 35 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
JMIV
2006
14 years 11 months ago
2006
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
100
Voted
WADS
2005
Springer
15 years 5 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
110
click to vote
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...