Sciweavers

276 search results - page 29 / 56
» The Complexity of Computing Maximal Word Functions
Sort
View
IWCMC
2009
ACM
14 years 2 months ago
Quantized transmit beamforming with antenna selection in a MIMO channel
For a point-to-point multi-input multi-output (MIMO) wireless channel, we propose a feedback scheme, which consists of transmit-antenna selection algorithm and beamforming quantiz...
Wiroonsak Santipach
ISMB
1994
13 years 8 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
IJON
2000
76views more  IJON 2000»
13 years 7 months ago
Fast neural network simulations with population density methods
The complexity of neural networks of the brain makes studying these networks through computer simulation challenging. Conventional methods, where one models thousands of individua...
Duane Q. Nykamp, Daniel Tranchina
PAA
2008
13 years 7 months ago
Motion synthesis through 1D affine matching
We present the study of a data-driven motion synthesis approach based on a 1D affine imagematching equation. We start by deriving the relevant properties of the exact matching oper...
Perfilino Eugênio Ferreira Jr., José ...
MST
1998
76views more  MST 1998»
13 years 7 months ago
Sharply Bounded Alternation and Quasilinear Time
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith