791 search results - page 129 / 159 » Approximating the Maximum Sharing Problem |
163
click to vote
PODC
1993
ACM
15 years 3 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 ...
179
click to vote
CVPR
2010
IEEE
15 years 1 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
15 years 1 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
14 years 11 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...
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...