473 search results - page 55 / 95 » Computing shortest paths with uncertainty |
221
click to vote
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
135
click to vote
PDPTA
2007
15 years 5 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
149
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
234
click to vote
GIS
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
130
click to vote
MASCOTS
2004
15 years 5 months ago
2004
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...