1964 search results - page 73 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
IPPS
2000
IEEE
14 years 6 days ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
ICIP
2007
IEEE
13 years 8 months ago
2007
IEEE
This paper addresses the issues of nonlinear edge-preserving image smoothing and segmentation. A ML-based approach is proposed which uses an iterative algorithm to solve the probl...
ICDE
2012
IEEE
11 years 10 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 ...
JMLR
2012
11 years 10 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...