3874 search results - page 465 / 775 » Approximation Algorithms for k-hurdle Problems |
159
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
154
click to vote
ICRA
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
183
click to vote
TCS
2011
15 years 1 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
162
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Clothing is one of the most informative cues of human appearance. In this paper, we propose a novel multi-person clothing segmentation algorithm for highly occluded images. The ke...
123
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
—Unlike in a wired network, a packet transmitted by a node in an ad hoc wireless network can reach all neighbors. Therefore, the total number of transmissions (forward nodes) is ...