2432 search results - page 353 / 487 » Using simple abstraction to reinvent computing for paralleli... |
159
click to vote
MIDDLEWARE
2005
Springer
15 years 9 months ago
2005
Springer
Pervasive and ad hoc computing applications are frequently deployed in dynamic networks. Due to mobility of the computing nodes, their unreliability, or a limited communication ra...
148
Voted
HIPC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using o...
146
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
163
click to vote
ICPP
1998
IEEE
15 years 8 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
157
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...