Sciweavers

9842 search results - page 411 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CIVR
2006
Springer
172views Image Analysis» more  CIVR 2006»
15 years 11 months ago
Retrieving Shapes Efficiently by a Qualitative Shape Descriptor: The Scope Histogram
Abstract. Efficient image retrieval from large image databases is a challenging problem. In this paper we present a method offering constant time complexity for the comparison of t...
Arne Schuldt, Björn Gottfried, Otthein Herzog
PPSN
2000
Springer
15 years 11 months ago
Optimization as Side-Effect of Evolving Allelopathic Diversity
Many bacteria carry gene complexes that code for a toxin-antidote pair, e.g. colicin systems. Such gene complexes can be advantageous for its host by killing competitor bacteria wh...
Ludo Pagie, Paulien Hogeweg
RT
1995
Springer
15 years 11 months ago
A Clustering Algorithm for Radiance Calculation in General Environments
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
François X. Sillion, George Drettakis, Cyri...
CDC
2008
IEEE
110views Control Systems» more  CDC 2008»
15 years 9 months ago
Topological identification in networks of dynamical systems
The paper deals with the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluat...
Donatello Materassi, Giacomo Innocenti
DAGSTUHL
2007
15 years 9 months ago
Approximating Solution Structure
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
Iris van Rooij, Matthew Hamilton, Moritz Müll...