Sciweavers

1017 search results - page 64 / 204
» Register computations on ordinals
Sort
View
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 9 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
ICMCS
2010
IEEE
215views Multimedia» more  ICMCS 2010»
13 years 7 months ago
Saliency detection: A self-ordinal resemblance approach
In saliency detection, regions attracting visual attention need to be highlighted while effectively suppressing non-salient regions for the semantic scene understanding. However, ...
Wonjun Kim, Chanho Jung, Changick Kim
FPL
2006
Springer
156views Hardware» more  FPL 2006»
14 years 25 days ago
Improving Usability of FPGA-Based Reconfigurable Computers Through Operating System Support
Advances in FPGA-based reconfigurable computers have made them a viable computing platform for a vast variety of computation demanding areas such as bioinformatics, speech recogni...
Hayden Kwok-Hay So, Robert W. Brodersen
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 2 months ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...
CASES
2001
ACM
14 years 25 days ago
A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
Girish Venkataramani, Walid A. Najjar, Fadi J. Kur...