Sciweavers

5 search results - page 1 / 1
» The Number Of Orientations Having No Fixed Tournament
Sort
View
COMBINATORICA
2006
91views more  COMBINATORICA 2006»
13 years 10 months ago
The Number Of Orientations Having No Fixed Tournament
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 ...
Noga Alon, Raphael Yuster
SECON
2010
IEEE
13 years 8 months ago
Placement and Orientation of Rotating Directional Sensors
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...
Giordano Fusco, Himanshu Gupta
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Fast space-variant elliptical filtering using box splines
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...
Kunal Narayan Chaudhury, Arrate Muñoz-Barru...
ICVGIP
2008
14 years 6 days ago
Fragment Based Tracking for Scale and Orientation Adaptation
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...
Viswanathan Srikrishnan, Tadinada Nagaraj, Subhasi...
ERSA
2008
145views Hardware» more  ERSA 2008»
14 years 6 days ago
Multicore Devices: A New Generation of Reconfigurable Architectures
For two decades, reconfigurable computing systems have provided an attractive alternative to fixed hardware solutions. Reconfigurable computing systems have demonstrated the low c...
Steven A. Guccione