11565 search results - page 358 / 2313 » Computing Minimal Mappings |
180
click to vote
BIBM
2010
IEEE
15 years 4 months ago
2010
IEEE
The 1000 Genome project has made available a large number of single nucleotide polymorphisms (SNPs) for genome-wide association studies (GWAS). However, the large number of SNPs ha...
274
click to vote
Lecture Notes
Driven by recent innovations in Field-Programmable Gate Arrays (FPGAs), reconfigurable computing offers unique ways to accelerate key algorithms. FPGAs offer a programmable logic f...
175
click to vote
ARITH
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
154
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
188
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...