4009 search results - page 168 / 802 » Clustering on Complex Graphs |
132
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
130
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
141
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
132
click to vote
RECOMB
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
175
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...