126 search results - page 15 / 26 » Consistent graph layout for weighted graphs |
160
Voted
DCG
2010
15 years 1 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
WEA
2009
Springer
15 years 8 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
ACCV
2009
Springer
15 years 8 months ago
2009
Springer
This paper addresses the problem of segmenting a textured mesh into objects or object classes, consistently with user-supplied seeds. We view this task as transductive learning and...
149
click to vote
IVC
2008
15 years 1 months ago
2008
In this paper, we address the issue of Euclidean path modeling in a single camera for activity monitoring in a multi-camera video surveillance system. The method consists of a pat...
NETWORKS
2010
14 years 12 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...