725 search results - page 140 / 145 » Bounding Degrees on RPL |
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
SIGMETRICS
2004
ACM
14 years 3 months ago
2004
ACM
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
SIGOPSE
2004
ACM
14 years 3 months ago
2004
ACM
Overlay networks are widely used to deploy functionality at edge nodes without changing network routers. Each node in an overlay network maintains pointers to a set of neighbor no...
COMPGEOM
2003
ACM
14 years 3 months ago
2003
ACM
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...