Sciweavers

968 search results - page 5 / 194
» A faster implementation of APlace
Sort
View
CIMAGING
2009
94views Hardware» more  CIMAGING 2009»
13 years 5 months ago
Iterative demosaicking accelerated: theory and fast noniterative implementations
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
Yue M. Lu, Mina Karzand, Martin Vetterli
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
13 years 11 months ago
When lisp is faster than C
This paper compares the performance of the program evaluation phase of genetic programming using C and Common Lisp. A simple experiment is conducted, and the conclusion is that ge...
Børge Svingen
PAIRING
2009
Springer
111views Cryptology» more  PAIRING 2009»
14 years 1 months ago
Faster Pairings on Special Weierstrass Curves
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...
Craig Costello, Hüseyin Hisil, Colin Boyd, Ju...
PVLDB
2008
123views more  PVLDB 2008»
13 years 6 months ago
Efficient implementation of sorting on multi-core SIMD CPU architecture
Sorting a list of input numbers is one of the most fundamental problems in the field of computer science in general and high-throughput database applications in particular. Althou...
Jatin Chhugani, Anthony D. Nguyen, Victor W. Lee, ...
DEBU
2010
152views more  DEBU 2010»
13 years 4 months ago
Implementing an Append-Only Interface for Semiconductor Storage
Solid-state disks are currently based on NAND flash and expose a standard disk interface. To accommodate limitations of the medium, solid-state disk implementations avoid rewritin...
Colin W. Reid, Philip A. Bernstein