2899 search results - page 40 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
138
Voted
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
157
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
167
Voted
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
179
Voted
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
169
Voted
PODS
2001
ACM
16 years 5 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...