Sciweavers

553 search results - page 56 / 111
» Cover Contact Graphs
Sort
View
WG
2004
Springer
15 years 3 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...

Lecture Notes
2770views
16 years 6 months ago
Lectures on Medical Image Analysis
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...
Tim McGraw
74
Voted
COCOON
2005
Springer
15 years 4 months ago
A Tight Analysis of the Maximal Matching Heuristic
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
Jean Cardinal, Martine Labbé, Stefan Langer...
MEMBRANE
2004
Springer
15 years 3 months ago
LMNtal: A Language Model with Links and Membranes
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
Kazunori Ueda, Norio Kato
75
Voted
COMBINATORICS
2006
155views more  COMBINATORICS 2006»
14 years 10 months ago
Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
Pawel Zylinski