Sciweavers

653 search results - page 49 / 131
» The size of minimum 3-trees
Sort
View
TIM
2011
172views more  TIM 2011»
14 years 6 months ago
Selecting a Reference High Resolution for Fingerprint Recognition Using Minutiae and Pores
—High-resolution automated fingerprint recognition systems (AFRSs) offer higher security because they are able to make use of level-3 features, such as pores, that are not avail...
David Zhang, Feng Liu, Qijun Zhao, Guangming Lu, N...
TSP
2010
14 years 6 months ago
Markov chain monte carlo detectors for channels with intersymbol interference
In this paper, we propose novel low-complexity soft-in soft-out (SISO) equalizers using the Markov chain Monte Carlo (MCMC) technique. We develop a bitwise MCMC equalizer (b-MCMC) ...
Ronghui Peng, Rong-Rong Chen, Behrouz Farhang-Boro...
SCOPES
2004
Springer
15 years 5 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
AB
2007
Springer
15 years 3 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
CORR
2007
Springer
91views Education» more  CORR 2007»
14 years 11 months ago
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
Junsheng Han, Paul H. Siegel, Ron M. Roth