#### Filter Results:

#### Publication Year

2007

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A subset S of a vertex set of a graph G is a total (k, r)-dominating set if every vertex u ∈ V (G) is within distance k of at least r vertices in S. The minimum cardinality among all total (k, r)-dominating sets of G is called the total (k, r)-domination number of G, denoted by γ t (k,r) (G). We previously gave an upper bound on γ t (2,r) (G(n, p)) in… (More)

- Louisa Harutyunyan, Karoly Lendvai, Ahmad Rasem, Jong-Hyouk Lee, Jean-Marie Bonnin, Georg Hampel +1 other
- 2013

This section is based [1]. Up until now in the course we have looked at log-linear models. We were interested in finding the probability given by P (y|x) = exp k k=1 λ k f k (x, y) y' exp k k=1 λ k f k (x, y ′). (10.1) Now, we would like to know what happens when y itself is a sequence? (i.e want P (y|x)). Traditionally, graphical models were used to… (More)

- ‹
- 1
- ›