577 search results - page 86 / 116 » Smartsockets: solving the connectivity problems in grid comp... |
ICDCSW
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper, we propose a new control method to cover the “holes” in wireless sensor networks. Many applications often face the problem of holes when some sensor nodes are d...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
ECCV
1998
Springer
14 years 10 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
IPPS
1996
IEEE
14 years 27 days ago
1996
IEEE
PVM and other distributed computing systems have enabled the use of networks of workstations for parallel computation, but their approach of treating all networks as collections o...