895 search results - page 58 / 179 » Approximate convex decomposition |
100
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
WG
2001
Springer
15 years 5 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
119
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
128
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
117
click to vote
MVA
2007
15 years 2 months ago
2007
This paper presents a new approach to extracting and representing structural features of images. The approach is based on both a region-based analysis and a contour-based analysis...