Sciweavers

2018 search results - page 89 / 404
» Code Normal Forms
Sort
View
124
Voted
CC
2004
Springer
134views System Software» more  CC 2004»
15 years 5 months ago
Widening Integer Arithmetic
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
Kevin Redwine, Norman Ramsey
PR
2006
125views more  PR 2006»
15 years 2 months ago
Palmprint identification using feature-level fusion
In this paper, we propose a feature-level fusion approach for improving the efficiency of palmprint identification. Multiple elliptical Gabor filters with different orientations a...
Adams Wai-Kin Kong, David Zhang, Mohamed Kamel
TIT
2002
91views more  TIT 2002»
15 years 1 months ago
On limited-delay lossy coding and filtering of individual sequences
Abstract--We continue the study of adaptive schemes for the sequential lossy coding of individual sequences which was recently initiated by Linder and Lugosi. Specifically, we cons...
Tsachy Weissman, Neri Merhav
BC
2004
86views more  BC 2004»
15 years 2 months ago
Is sparse and distributed the coding goal of simple cells?
Abstract. The question of why the receptive fields of simple cells in the primary visual cortex are Gabor-like is a crucial one in vision research. Many research efforts (Olshausen...
Li Zhao
ENTCS
2002
181views more  ENTCS 2002»
15 years 1 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin