Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
498
On-Line Rankings of Graphs
, 1997
"... A (vertex) k-ranking of a graph G = (V; E) is a proper vertex coloring ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
A (vertex) k-ranking of a graph G = (V; E) is a proper vertex coloring
On-line Ranking of Split Graphs
"... A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorith ..."
Abstract
- Add to MetaCart
A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line
1 2 Parallel Algorithm for On-Line Ranking in Trees
"... A node k-ranking of a graph G = (V, E) is a proper node coloring C: V � {1, 2, …, k} such that any x-y path in G with C(x) = C(y) contains an internal node z with C(z) �C(x). In the on-line version of this problem, the nodes v1, v2, …, vn are coming one by one in an arbitrary order; and only the ed ..."
Abstract
- Add to MetaCart
A node k-ranking of a graph G = (V, E) is a proper node coloring C: V � {1, 2, …, k} such that any x-y path in G with C(x) = C(y) contains an internal node z with C(z) �C(x). In the on-line version of this problem, the nodes v1, v2, …, vn are coming one by one in an arbitrary order; and only
On-line selection of discriminative tracking features
, 2003
"... This paper presents an on-line feature selection mechanism for evaluating multiple features while tracking and adjusting the set of features used to improve tracking performance. Our hypothesis is that the features that best discriminate between object and background are also best for track-ing the ..."
Abstract
-
Cited by 356 (5 self)
- Add to MetaCart
This paper presents an on-line feature selection mechanism for evaluating multiple features while tracking and adjusting the set of features used to improve tracking performance. Our hypothesis is that the features that best discriminate between object and background are also best for track-ing
Learning to Order Things
- Journal of Artificial Intelligence Research
, 1998
"... There are many applications in which it is desirable to order rather than classify instances. Here we consider the problem of learning how to order, given feedback in the form of preference judgments, i.e., statements to the effect that one instance should be ranked ahead of another. We outline a ..."
Abstract
-
Cited by 409 (12 self)
- Add to MetaCart
that the problem of finding the ordering that agrees best with a preference function is NP-complete, even under very restrictive assumptions. Nevertheless, we describe a simple greedy algorithm that is guaranteed to find a good approximation. We then discuss an on-line learning algorithm, based on the "
Greedy Rankings and Arank Numbers
, 2009
"... A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices of the same rank contains a vertex of strictly larger rank. A ranking is locally minimal if reducing the rank of any single vertex produces a non ranking. A ranking is globally minimal ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
one property it satisfies all three. As a consequence of this and known results on arank numbers of paths we improve known upper bounds for on-line ranking. 1
De featurefrequentiemethode en de classificatie van nederlandse dialecten
- TABU: Bulletin voor Taalwetenschap
, 1988
"... Abstract- A node k-ranking of a graph G = (V, E) is a proper node coloring C: V � {1, 2,…, k} such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) �C(x). In the on-line version of this problem, the nodes v1, v2,…, vn are coming one by one in an ar ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract- A node k-ranking of a graph G = (V, E) is a proper node coloring C: V � {1, 2,…, k} such that any path in G with end nodes x, y fulfilling C(x) = C(y) contains an internal node z with C(z) �C(x). In the on-line version of this problem, the nodes v1, v2,…, vn are coming one by one
Results 1 - 10
of
498
