3244 search results - page 448 / 649 » On convex complexity measures |
178
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
159
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
119
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Bonn, Germany, August 24-27, 2009 Bayesian boundary models often assume tha...
246
click to vote
EMO
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
162
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...