Sciweavers

20 search results - page 4 / 4
» Structured matrix methods for polynomial root-finding
Sort
View
ICDM
2005
IEEE
125views Data Mining» more  ICDM 2005»
13 years 11 months ago
Alternate Representation of Distance Matrices for Characterization of Protein Structure
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
Keith Marsolo, Srinivasan Parthasarathy
ENGL
2008
192views more  ENGL 2008»
13 years 5 months ago
Sensitivity Analysis for Direction of Arrival Estimation using a Root-MUSIC Algorithm
An array antenna system with innovative signal processing can enhance the resolution of a signal direction of arrival (DOA) estimation. Super resolution algorithms take advantage o...
Zekeriya Aliyazicioglu, H. K. Hwang, Marshall Gric...
PIMRC
2010
IEEE
13 years 3 months ago
Fast varying channel estimation in downlink LTE systems
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...
Youssef El Hajj Shehadeh, Serdar Sezginer
BMCBI
2006
127views more  BMCBI 2006»
13 years 5 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
QEST
2008
IEEE
14 years 22 hour ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...