5 search results - page 1 / 1 » The Number Of Orientations Having No Fixed Tournament |
COMBINATORICA
2006
13 years 5 months ago
2006
Let T be a fixed tournament on k vertices. Let D(n, T) denote the maximum number of orientations of an n-vertex graph that have no copy of T. We prove that D(n, T) = 2tk-1(n) for ...
SECON
2010
IEEE
13 years 3 months ago
2010
IEEE
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is po...
ICVGIP
2008
13 years 6 months ago
2008
In this work, we propose a simple yet highly effective algorithm for tracking a target through significant scale and orientation change. We divide the target into a number of frag...
ERSA
2008
13 years 6 months ago
2008
For two decades, reconfigurable computing systems have provided an attractive alternative to fixed hardware solutions. Reconfigurable computing systems have demonstrated the low c...