1054 search results - page 82 / 211 » Capacitated Domination Problem |
112
click to vote
ICPP
2002
IEEE
15 years 8 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...
107
click to vote
ICIAR
2010
Springer
15 years 7 months ago
2010
Springer
The structural similarity (SSIM) index has been shown to be an useful tool in a wide variety of applications that involve the assessment of image quality and similarity. However, i...
100
click to vote
AAAI
2010
15 years 4 months ago
2010
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...
210
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
151
click to vote
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...