373 search results - page 36 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
EVOW
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
ICMCS
2000
IEEE
14 years 13 days ago
2000
IEEE
In content based retrieval, color indexing is one of the most prevalent retrieval methods. Two key problems in color indexing are (1) determination of the color space and (2) fin...