383 search results - page 62 / 77 » A Bound on the Total Chromatic Number |
ESA
2006
Springer
13 years 11 months ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
LREC
2010
13 years 9 months ago
2010
In natural language relationships between entities can asserted within a single sentence or over many sentences in a document. Many information extraction systems are constrained ...
DAGSTUHL
2006
13 years 9 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
SIROCCO
2000
13 years 9 months ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...