4894 search results - page 535 / 979 » The Guarding Problem - Complexity and Approximation |
141
click to vote
CAIP
2005
Springer
15 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
170
click to vote
WIRN
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
126
click to vote
AMDO
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, a method for image deformation is presented. It is based upon decomposition of the deformation problem into basic physical laws. Unlike other methods that solve a di...
154
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
151
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...