7930 search results - page 1447 / 1586 » Greedy in Approximation Algorithms |
149
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 4 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...
142
click to vote
ICANN
2010
Springer
15 years 4 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 ...
150
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
We present a method for nonrigid registration of 2-D geometric shapes. Our contribution is twofold. First, we extend the classic chamfer-matching energy to a variational functional...
129
click to vote
ADHOC
2010
15 years 4 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...
158
click to vote
CGF
2010
15 years 4 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...