Sciweavers

829 search results - page 86 / 166
» Distance domination-critical graphs
Sort
View
ECEASST
2008
91views more  ECEASST 2008»
14 years 12 months ago
Graph Transformation Model of a Triangulated Network of Mobile Units
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
Stefan Gruner
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
14 years 12 months ago
Error Compensation in Leaf Power Problems
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
CVIU
2004
134views more  CVIU 2004»
14 years 11 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
EC
2007
118views ECommerce» more  EC 2007»
14 years 12 months ago
Geometric Crossovers for Multiway Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
APPML
2007
154views more  APPML 2007»
15 years 21 hour ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio