194 search results - page 27 / 39 » Computing Roundness is Easy if the Set is Almost Round |
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Many applications need to segment out all small round
regions in an image. This task of finding dots can be viewed
as a region segmentation problem where the dots form one
regio...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
ICDCSW
2005
IEEE
14 years 1 months ago
2005
IEEE
In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flood...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
SC
2005
ACM
14 years 1 months ago
2005
ACM
The GridFTP extensions to the File Transfer Protocol define a general-purpose mechanism for secure, reliable, high-performance data movement. We report here on the Globus striped ...