307 search results - page 9 / 62 » A Comparison of Algorithms for Connected Set Openings and Cl... |
ICIP
2009
IEEE
14 years 8 months ago
2009
IEEE
In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new tech...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
P2P
2008
IEEE
14 years 1 months ago
2008
IEEE
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
PET
2004
Springer
14 years 22 days ago
2004
Springer
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
IJCAI
1997
13 years 8 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...