836 search results - page 124 / 168 » Orthogonal Colorings of Graphs |
114
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
114
Voted
SOFSEM
2010
Springer
15 years 8 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 ...
112
Voted
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 ...
105
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...