[PDF] Top 20 Is “Time” Speeding up?

... “astronomical” time, which is based upon the quasi-perpetual rotational and revolutionary motions of heavenly ...of time would be “thermody- namic” time, the measurement of which is based upon the ... See full document

... In the improve PIFS coding stage , the range and domain pools generated first , The most computationally intensive part of the FIC process is the search step. One way to decrease encoding time is to decrease the ... See full document

... In real-time applications, major industries are using the data mining technology to their favor. The concept of data mining is used to correlate the internal and external factors. This gives clues to find out the ... See full document

... In this paper we first discussed three different caching al- gorithms for the BP algorithm eliminating three different types of repetition. The Toplevel 1-cache algorithm cov- ers only sequential repetitions of the full ... See full document

... The proposed search methods gain the similar superiority on CPUs to that on GPUs, and the decoding speed is obviously slower than that on GPUs. From the Figure 5a, we can also clearly see that, compared with the NBS-SN, ... See full document

... Modern data is captured much faster than it can be analyzed. Novel applications of digital imaging demand super-fast image analysis and recognition. Self-driving vehi- cles, unmanned aerial vehicles (UAV) and autonomous ... See full document

... For each event we apply the methodology previously de- scribed, and use the W-phase centroid moment tensor, a scal- ing law, and an elliptic slip distribution to define the first source. Then, the linear and nonlinear ... See full document

... Based on its excellent performance and paradigmatic nature, Consensus is a natural candidate for the inves- tigation of an algorithmic speed-up aimed at reducing the mentioned bottleneck. To this end, here we ... See full document

... This paper describes three techniques for controlling the loop filter of the PLL for high operating speed. The proposed fast- locking PLL reduces the pull-in time and enhances the switching speed, while ... See full document

... and time-consuming task, since i) many parameters have to be taken into account, such as the number of the levels of tiling, tile sizes, loop unroll depth, software pipelining strategies, register allocation, code ... See full document

... building up of the special type renormalization involves the following sequence of steps: boundedness of amplitudes and rates provides addi- tive decomposition of the power spectrum to a specific and continuous ... See full document

... In a general algorithm, the determination of an active point can be divided into two parts: the non-leaf node and the leaf node part. The process of a general isosurface extraction algorithm is shown in Figure 2. In the ... See full document

... Pre-execution dispatches two copies of the same algo- rithm: a “main” version and the “pre-execution” version which is a slight modification of the algorithm (it commits no changes into the main memory). Any data one ... See full document

... 3.8. Find the optimum data array layouts and decrease the exploration space At this step, the (near)-optimum data array layouts are found. In this way, the spatial data reuse is further utilized and the number of data ... See full document

... this time has been ‘New Public Management’, a governance framework that originated in New Zealand in the 1980s (Schedler and Proeller 2002, 163) and gradually spread to the UK (indeed worldwide in vari- ous ... See full document

... the time to perform full syntactic parses, and we have presented a method to apply the informa- tion from partial parsing to full syntactic parsers that use a variant of the CYK ...the time to parse by an ... See full document

... most time-consuming operation, in terms of the execution time, and since the core curve-operation, namely the scalar multiplication operation, which is the heart of most cryptographic applications based on ... See full document

... It is well known that the higher precision of reliability analysis is better, but higher precision will consume more time. When the precision reaches one certain level, the required running times that can increase ... See full document

... the time required to check the nodes which lie in between the current lane node and previous lane node as per our ...the time required to check the nodes which lie between the two nodes in the lane ...of ... See full document

... as a commercial product. There are two overwhelming arguments for looking at HE also as something that can be sold: if we believe our HE system is good, we should make it available to the rest of the world. The second ... See full document