1363 search results - page 182 / 273 » The road coloring problem |
103
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a novel method for stereo matching with occlusion handling. In order to estimate optimal cost, we define an energy function and solve the iterative equation w...
AMR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The advent of digital photography calls for effective techniques for managing growing amounts of color images. Systems that only rely on low-level image features are now...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
102
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
ISMVL
2006
IEEE
15 years 5 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...