Results 251 to 260 of about 600,785 (306)
Some of the next articles are maybe not open access.
Look-up-table based halftoning algorithm
Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269), 2000Screening is a low complexity halftoning algorithm that has been widely used in many applications. However, screen design requires that the stacking property be obeyed. This constraint limits the texture quality at each gray level. We present a look-up-table based halftoning algorithm for which the stacking constraint is not necessarily satisfied; but ...
Pingshan Li, Jan P. Allebach
openaire +2 more sources
The look‐up table: A classifier for cell sorters
Cytometry, 1981AbstractCurrently used classifiers for flow cell sorters are described and the look‐up table is introduced as such. An experimental setup of a look‐up table classifier added to a commercially available cell sorter, under control of a microcomputer is described. The contents of the look‐up table are obtained from contrours of regions of interest.
G J, Koper, J G, Christiaanse
openaire +2 more sources
Function evaluation by table look-up and addition
Proceedings of the 12th Symposium on Computer Arithmetic, 2002We describe a general approach decomposing a function into a sum of functions, each with a smaller input site than the original. Hence we can map such functions with essentially the same precision using small ROM tables and adders. We derive an easy method to compute the worst case error for many elementary functions and an error bound for the rest ...
Hannes Hassler, Naofumi Takagi
openaire +1 more source
Look up table (LUT) inverse halftoning
2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353), 2002In this paper we propose a novel method for inverse halftoning of images. The method is basically a Look Up Table (LUT) based method. The LUT for inverse halftoning is obtained from the histogram gathered from a few sample halftone images and corresponding original images.
Murat Mese, Palghat P. Vaidyanathan
openaire +1 more source
Regrasp planner using look-up table
Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113), 2002Regrasping, given initial and final pose of the target object, is a construction of sequential transition of object poses that are compatible with two poses in the point of grasp configuration. This paper presents a novel approach for solving the regrasp problem. The approach consists of a preprocessing and planning stages. Preprocessing, which is done
Kyoungrae Cho +3 more
openaire +1 more source
Look-up table leakage reduction for FPGAs
Proceedings of the IEEE 2005 Custom Integrated Circuits Conference, 2005., 2006We propose new programmable FPGA look-up tables (LUTs) that can operate in two different modes: high-performance or low-power. Selection between the two modes is realized by an extra SRAM cell that can be shared by a number of LUTs. In high-performance mode, the LUTs provide similar power and performance to a conventional LUT.
Navid Azizi, Farid N. Najm
openaire +1 more source
BIT, 1973
A more realistic bound for the average number of comparisons needed to match an incoming identifier by table look-up, when the table is still growing, is derived.
openaire +1 more source
A more realistic bound for the average number of comparisons needed to match an incoming identifier by table look-up, when the table is still growing, is derived.
openaire +1 more source
Fast search algorithms for look‐up tables
Engineering Computations, 2003Various parameter values are provided in the form of data tables, where data keys are ordered and unevenly spaced in general, for real‐time simulation of dynamic systems. However, most parameter values required for simulation do not explicitly exist in data tables. Thus, unit intervals, including parameter values, are searched rather than the data keys.
Yoon, Sugjoon, Kang, Hyunjoo
openaire +1 more source
Table look-up graphic interpolation
1985In this paper a fast procedure is presented to fairly interpolate a given set of points, which is mainly based on the use of table look-up techniques . Storage amoun ts required can be easily supplied by present memories technology. Though our procedure can be applied to any interpolation method, it is well suited for a spline, using an angle as a ...
Alia G. +3 more
openaire +4 more sources
Parallel modular multiplication with table look-up
International Journal of Computer Mathematics, 1998Modular exponentiation with a large modulus (usually longer than 512 bits) is the main operation in most number-theoretic cryptosystems. A modular exponentiation can be carried out by iteration of modular multiplications. Therefore, design of a fast modular multiplication algorithm is the key to developing a high performance encryption/decryption ...
Che Wun Chiou, Ted C. Yang
openaire +1 more source