718 search results - page 106 / 144 » Coloring quasi-line graphs |
112
click to vote
GRAPHICSINTERFACE
2000
15 years 3 months ago
2000
In this paper, we present an efficient way to denoise bivariate data like height fields, color pictures or vector fields, while preserving edges and other features. Mixing surface...
181
click to vote
GMP
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. Riemann surfaces naturally appear in the analysis of complex functions that are branched over the complex plane. However, they usually possess a complicated topology and ...
107
click to vote
SIAMDM
2008
15 years 1 months ago
2008
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
122
click to vote
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
In this paper, we propose an approach to accurately localize detected objects. The goal is to predict which features pertain to the object and define the object extent with segme...
124
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...