2163 search results - page 224 / 433 » cases 2004 |
170
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
158
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
Delaunay tessellations and Voronoi diagrams capture proximity relationships among sets of points in any dimension. When point coordinates are not known exactly, as in the case of ...
150
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
149
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
181
click to vote
SPLC
2004
15 years 8 months ago
2004
Abstract. This paper proposes a 4-dimensional software product family engineering evaluation framework. The four dimensions relate to the software engineering concerns of business,...