511 search results - page 12 / 103 » TSP with bounded metrics |
ARSCOM
2008
14 years 12 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
FM
2009
Springer
15 years 6 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
108
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ICIP
2004
IEEE
16 years 1 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
84
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— A main difficulty for orbit determination of space debris is the correlation of tracks of data belonging to the same physical object. A sequence of optical measurements of an ...