Sciweavers

1560 search results - page 12 / 312
» Order Functions and Evaluation Codes
Sort
View
ARITH
2003
IEEE
14 years 24 days ago
"Partially Rounded" Small-Order Approximations for Accurate, Hardware-Oriented, Table-Based Methods
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose orde...
Jean-Michel Muller
ICC
2007
IEEE
125views Communications» more  ICC 2007»
14 years 1 months ago
Performance Evaluation of Wireless Sensor Networks Using Turbo Codes with Multi-Route Transmission
— Wireless sensor networks (WSNs) usually have a regular lattice structure and can be considered as multi-hop multi-route networks. In multi-route transmissions, even if the link...
Tadahiro Wada, Kouji Ohuchi, Abbas Jamalipour, Hir...
IISWC
2006
IEEE
14 years 1 months ago
A Quantitative Evaluation of the Contribution of Native Code to Java Workloads
— Many performance analysis tools for Java focus on tracking executed bytecodes, but provide little support in determining the specific contribution of native code libraries. Th...
Walter Binder, Jarle Hulaas, Philippe Moret
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
14 years 8 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
ICIP
2000
IEEE
14 years 9 months ago
Finite Precision Wavelets for Image Coding: Lossy and Lossless Compression Performance Evaluation
This paper investigates the robustness of the wavelet transform, implemented by means of the Lifting Scheme (LS), with respect to numerical errors in the representation and calcul...
Marco Grangetto, Enrico Magli, Gabriella Olmo