340 search results - page 19 / 68 » Approximate equality is no fuzzy equality |
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
IPL
2002
13 years 7 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
SCALESPACE
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Gaussian convolutions are perhaps the most often used image operators in low-level computer vision tasks. Surprisingly though, there are precious few articles that descri...