Sciweavers

552 search results - page 45 / 111
» Constrained Shortest Path Computation
Sort
View
IEEEMSP
2002
IEEE
15 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
DSN
2004
IEEE
15 years 1 months ago
Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by t...
Gunjan Khanna, Saurabh Bagchi, Yu-Sung Wu
ICDCS
2010
IEEE
14 years 10 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
ICCV
2007
IEEE
15 years 11 months ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
AROBOTS
2005
100views more  AROBOTS 2005»
14 years 9 months ago
A Sampling-Based Motion Planning Approach to Maintain Visibility of Unpredictable Targets
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
Rafael Murrieta-Cid, Benjamín Tovar, Seth H...