791 search results - page 129 / 159 » Approximating the Maximum Sharing Problem |
PODC
1993
ACM
13 years 11 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
VMV
2008
13 years 9 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
DSS
2007
13 years 7 months ago
2007
Corporate collaboration allows organizations to improve the efficiency and quality of their business activities. It may occur as a workflow collaboration, a supply chain collabora...
ACTA
2005
13 years 7 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...