Sciweavers

2173 search results - page 391 / 435
» On the Values of Reducibility Candidates
Sort
View
BMCBI
2005
108views more  BMCBI 2005»
13 years 8 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer
CVPR
2006
IEEE
14 years 10 months ago
Selecting Principal Components in a Two-Stage LDA Algorithm
Linear Discriminant Analysis (LDA) is a well-known and important tool in pattern recognition with potential applications in many areas of research. The most famous and used formul...
Aleix M. Martínez, Manli Zhu
ICIP
2005
IEEE
14 years 10 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
ICIP
2000
IEEE
14 years 10 months ago
Look up Table (LUT) Method for Image Halftoning
Recently we have applied Look Up Table (LUT) Method for inverse halftoning. We also proposed tree-structure LUT inverse halftoning in order to reduce memory requirements of the LU...
Murat Mese, Palghat P. Vaidyanathan
DAC
2004
ACM
14 years 9 months ago
An analytical approach for dynamic range estimation
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
Bin Wu, Jianwen Zhu, Farid N. Najm