13 search results - page 2 / 3 » Label placement by maximum independent set in rectangles |
EUROPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
TCS
2008
13 years 5 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
APPROX
2009
Springer
13 years 12 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
NIPS
2007
13 years 6 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...