44 search results - page 1 / 9 » (p, 1)-Total labelling of graphs |
DM
2008
13 years 4 months ago
2008
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
ICCV
1999
IEEE
14 years 6 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
IJCGA
2010
13 years 1 months ago
2010
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We consider the problem of multiclass classification where both labeled and unlabeled data points are given. We introduce and demonstrate a new approach for estimating a distribut...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...