358 search results - page 9 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
113
click to vote
ACTA
2005
14 years 11 months ago
2005
Clusters and distributed systems offer fault tolerance and high performance through load sharing. When all n computers are up and running, we would like the load to be evenly distr...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
113
click to vote
CONTEXT
2003
Springer
15 years 5 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...