355 search results - page 59 / 71 » On Central Spanning Trees of a Graph |
JDA
2007
15 years 20 days ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
87
Voted
TROB
2008
15 years 20 days ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
119
Voted
ALGORITHMICA
2002
15 years 19 days ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
107
Voted
COLING
2002
15 years 18 days ago
2002
Ambiguity is very high for location names. For example, there are 23 cities named `Buffalo' in the U.S. Country names such as `Canada', `Brazil' and `China' ar...
101
Voted
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...