1016 search results - page 95 / 204 » Generalized distances between rankings |
139
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
101
click to vote
WLP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present an overview on the AT(x) approach which is capable of automatically analyzing programs with respect to given tests and a reference solution. In the context of ...
117
click to vote
ICPR
2002
IEEE
15 years 6 months ago
2002
IEEE
A novel scheme for image segmentation is presented. An image segmentation criterion is proposed that gathers similar pixels together to form regions and creates boundaries between...
AIPS
2008
15 years 3 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
AMC
2010
15 years 1 months ago
2010
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...