383 search results - page 54 / 77 » A Bound on the Total Chromatic Number |
CCCG
2008
13 years 11 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
PAMI
2008
13 years 10 months ago
2008
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
IOR
2008
13 years 10 months ago
2008
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
SPAA
1996
ACM
14 years 2 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...