251 search results - page 18 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
96
Voted
SODA
1992
ACM
14 years 10 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
96
Voted
DAGM
2005
Springer
15 years 3 months ago
2005
Springer
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
78
Voted
AAAI
2008
14 years 12 months ago
2008
Two dimensional plots (2-D) in digital documents on the web are an important source of information that is largely under-utilized. In this paper, we outline how data and text can ...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...