50 search results - page 6 / 10 » Note on Upper Bounds for TSP Domination Number |
GC
2011
Springer
13 years 2 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper investigates the impulse response estimation of linear time-invariant (LTI) systems when only noisy finitelength input-output data of the system is available. ...
QEST
2006
IEEE
14 years 1 months ago
2006
IEEE
We analyze the effect of a few fiber delay loops on the number of deflections in an all optical packet switch. The switch is based on the ROMEO architecture developed by Alcatel...
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...