1133 search results - page 192 / 227 » Basics of Graph Cuts |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
CORR
2007
Springer
13 years 9 months ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
DSS
2007
13 years 9 months ago
2007
: As supply chains become more dynamic it is important to be able to model them formally as business processes. In particular, there is a need for a sense and respond capability to...
JODS
2007
13 years 8 months ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
IFM
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents initial results of research aimed at developing methods and tools for multidisciplinary collaborative development of dependable embedded systems. We focus on th...