Sciweavers

2294 search results - page 117 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
PR
2007
134views more  PR 2007»
14 years 9 months ago
An elastic partial shape matching technique
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...
INFOCOM
2009
IEEE
15 years 4 months ago
MARA: Maximum Alternative Routing Algorithm
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
Yasuhiro Ohara, Shinji Imahori, Rodney Van Meter
SECURWARE
2008
IEEE
15 years 4 months ago
Optimal Trust Network Analysis with Subjective Logic
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
Audun Jøsang, Touhid Bhuiyan
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 3 months ago
Hierarchical Map Building and Planning based on Graph Partitioning
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
Zoran Zivkovic, Bram Bakker, Ben J. A. Kröse
CORR
2011
Springer
212views Education» more  CORR 2011»
14 years 4 months ago
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these ...
Haris Aziz, Troels Bjerre Sørensen