1749 search results - page 164 / 350 » Conditional colorings of graphs |
183
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
168
click to vote
GRAPHICSINTERFACE
2000
15 years 8 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...
261
click to vote
GMP
2010
IEEE
15 years 6 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 ...
177
click to vote
SIAMDM
2008
15 years 6 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...
194
click to vote
CVPR
2012
IEEE
13 years 9 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...