5624 search results - page 419 / 1125 » On Conditional Covering Problem |
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
165
click to vote
ARSCOM
2005
15 years 6 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
182
click to vote
TCS
2008
15 years 6 months ago
2008
A two-dimensional word is a function on Z2 with finite number of values. The main problem we are interested in is periodicity of twodimensional words satisfying some local conditi...
162
click to vote
ENDM
2000
15 years 6 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...