34 search results - page 4 / 7 » L(2, 1)-labelling of graphs |
104
click to vote
CVIU
2011
14 years 1 months ago
2011
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
: Handoff at the link layer 2 (L2) consists of three phases including scanning, authentication, and reassociation. Among the three phases, scanning is dominant in terms of time del...
ICDCS
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...