4843 search results - page 861 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 3 months ago
—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...
134
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
This paper addresses the problem of lip segmentation in color space, which is a crucial issue to the success of a lip-reading system. We present a new segmentation approach to lip ...
118
click to vote
ADHOC
2010
15 years 3 months ago
2010
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
126
click to vote
CGF
2008
15 years 3 months ago
2008
We present a robust and efficient algorithm for the pairwise non-rigid registration of partially overlapping 3D surfaces. Our approach treats non-rigid registration as an optimiza...
144
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...