6251 search results - page 252 / 1251 » Randomness, Computability, and Density |
133
click to vote
JDA
2008
15 years 4 months ago
2008
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
111
click to vote
TWC
2008
15 years 4 months ago
2008
Abstract-- In this paper, we first present an analytical procedure for the computation of the node isolation probability and coverage in an ad hoc network in the presence of channe...
146
Voted
ALGORITHMICA
1998
15 years 4 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
124
click to vote
COMBINATORICA
2008
15 years 3 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
154
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We address the problem of segmenting 3D scan data into objects or object classes. Our segmentation framework is based on a subclass of Markov Random Fields (MRFs) which support ef...