نتایج جستجو برای: precomputed table

تعداد نتایج: 118833  

Journal: :J. Electronic Imaging 1993
Mark E. Lucente

Several methods of increasing the speed and simplicity of the computation of o axis transmission holograms are presented with applications to the real time display of holographic images The bipolar intensity approach allows for the real valued linear summation of interference fringes a factor of speed increase and the elimination of image noise caused by object self interference An order of mag...

2007
Y. W. Bai Y. C. Wu Weimin Zheng

Based on our survey of recent articles, there is little research being conducted into quantitative analysis of the load balancing of Web server clusters. In this paper, we propose a quantitative analysis for DNS-based server clusters. We also propose a two-pass load-balancing method for determining the load balance area of these clusters. The first pass uses the lookup table instead of a compli...

2001
Brian Zaugg Parris K. Egbert

We present Voxel Column Culling, an occlusion culling algorithm for real−time rendering of large terrain models. This technique can greatly reduce the number of polygons that must be rendered every frame, allowing a larger piece of terrain to be rendered at an interactive frame−rate. This is accomplished by using a form of 3D cell−based occlusion culling. A visibility table for the terrain mode...

2014
K. G. SHANTHI N. NAGARAJAN

In this paper, high speed and area efficient multiplier-less architecture for Finite impulse response filter (FIR) based on distributed arithmetic is presented. The proposed Lookup table less architecture for FIR filter uses the speed advantage of Carry save adder. A modification in the shift accumulator stage yields both high speed and area savings. Furthermore, Memory reduction is possible si...

2009
K V Viswanatha

Routing in dynamic network is a challenging one, because the topology of the network is not fixed. This issue is addressed in this presentation using ant algorithm to explore the network using intelligent packets. The paths generated by ants are given as input to genetic algorithm. The genetic algorithm finds the set of optimal routes. The importance of using ant algorithm is to reduce the size...

2012
Anders Eriksson

...................................................................................................................................... I Referat ....................................................................................................................................... II 초록 .................................................................................................................

1993
Mark Lucente

Several methods of increasing the speed and simplicity of the computation of oo-axis transmission holograms are presented, with applications to the real-time display of holographic images. The bipolar intensity approach allows for the real-valued linear summation of interference fringes, a factor of 2 speed increase, and the elimination of image noise caused by object self-interference. An orde...

2010
Manfred Lau James J. Kuffner

The traditional A*-search method builds a search tree of potential solution paths during runtime. An alternative approach is to compute this search tree in advance, and then use it during runtime to efficiently find a solution. Recent work has shown the potential for this idea of precomputation. However, these previous methods do not scale to the memory and time needed for precomputing trees of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید