4894 search results - page 801 / 979 » The Guarding Problem - Complexity and Approximation |
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
ICIP
2008
IEEE
14 years 9 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
The last generation of satellites leads to the very high-resolution images which offer a high quality of detailed information about the Earth's surface. However, the exploita...