1404 search results - page 118 / 281 » Optimization problems in multiple-interval graphs |
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...
112
click to vote
CVPR
2003
IEEE
15 years 3 months ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
CSJM
2006
14 years 10 months ago
2006
The popularity of distributed file systems continues to grow in last years. The reasons they are preferred over traditional centralized systems include fault tolerance, availabili...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
102
click to vote
EMMCVPR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...