Sciweavers

526 search results - page 54 / 106
» On the Number of Minimal Addition Chains
Sort
View
SADM
2010
196views more  SADM 2010»
14 years 4 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty
ICC
2009
IEEE
124views Communications» more  ICC 2009»
14 years 7 months ago
Optimal Weighted Antenna Selection for Imperfect Channel Knowledge from Training
Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio ...
Vinod Kristem, Neelesh B. Mehta, Andreas F. Molisc...
SIAMIS
2010
141views more  SIAMIS 2010»
14 years 4 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
DAC
2009
ACM
15 years 10 months ago
Handling don't-care conditions in high-level synthesis and application for reducing initialized registers
Don't-care conditions provide additional flexibility in logic synthesis and optimization. However, most work only focuses on the gate level because it is difficult to handle ...
Hong-Zu Chou, Kai-Hui Chang, Sy-Yen Kuo
ICASSP
2009
IEEE
15 years 4 months ago
Reducing F0 Frame Error of F0 tracking algorithms under noisy conditions with an unvoiced/voiced classification frontend
In this paper, we propose an F0 Frame Error (FFE) metric which combines Gross Pitch Error (GPE) and Voicing Decision Error (VDE) to objectively evaluate the performance of fundame...
Wei Chu, Abeer Alwan