358 search results - page 57 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
131
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
123
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
136
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
We present a surprisingly simple system that allows for robust normal reconstruction by dense photometric stereo, in the presence of severe shadows, highlight, transparencies, com...
128
Voted
HPCA
2003
IEEE
16 years 2 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
114
click to vote
BTW
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Clustering has become an increasingly important task in modern application domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or whe...