5595 search results - page 447 / 1119 » Approximation Algorithms for Clustering Problems |
172
click to vote
GBRPR
2009
Springer
15 years 11 months ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
206
click to vote
STACS
2005
Springer
16 years 11 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
197
click to vote
IJCAI
2007
15 years 8 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
190
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In the fields of image processing and recognition, image segmentation is an important basic technique in which an image is partitioned into multiple regions (sets of pixels). ...
146
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...