358 search results - page 40 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
PODC
2009
ACM
16 years 2 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
151
click to vote
IJCV
2000
15 years 1 months ago
2000
We describe how to model the appearance of a 3-D object using multiple views, learn such a model from training images, and use the model for object recognition. The model uses pro...
139
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
131
click to vote
ICPP
1992
IEEE
15 years 6 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...
100
click to vote
GRID
2007
Springer
15 years 1 months ago
2007
Springer
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...