2503 search results - page 451 / 501 » A study of 3-arc graphs |
JSYML
2010
13 years 2 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
HICSS
1997
IEEE
13 years 12 months ago
1997
IEEE
One model of multithreading gaining popularity on multiprocessor systems is the message-driven model of computation. The message-driven model is a reactive model in which an arriv...
MM
1993
ACM
13 years 11 months ago
1993
ACM
In this paper, we describe MPEGTool, an X window based tool which can be used to generate an MPEG2 encoded bit stream for video sequences and to study the statistical properties o...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
CAE
2007
13 years 10 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...