759 search results - page 81 / 152 » Optimal Graph Search with Iterated Graph Cuts |
SSDBM
2010
IEEE
14 years 7 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
75
Voted
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
Initial results have been achieved for automatic synthesis of MEMS system-level lumped parameter models using genetic programming and bond graphs. This paper first discusses the ne...