Sciweavers

229 search results - page 5 / 46
» On the Number of Arrangements of Pseudolines
Sort
View
IEICET
2007
97views more  IEICET 2007»
13 years 7 months ago
A Circular Aperture Array Configuration with a Small Antenna Radius
In this paper, small sized array configurations with small number of element are investigated. As the antenna size, the diameter less than 3λo is assumed. The investigated config...
Takanori Noro, Yasuhiro Kazama, Masaharu Takahashi...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 7 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
IWPEC
2004
Springer
14 years 1 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
CVPR
2010
IEEE
14 years 1 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
ERSA
2006
105views Hardware» more  ERSA 2006»
13 years 9 months ago
A Column Arrangement Algorithm for a Coarse-grained Reconfigurable Architecture
In a coarse-grained reconfigurable architecture, the functions of resources such as Arithmetic Logic Units (ALUs) can be reconfigured. Unlike the programmability of a general purp...
Yuanqing Guo, Cornelis Hoede, Gerard J. M. Smit