• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 11,011
Next 10 →

Table 2. Number of radar observations for radial velocity and reflectivity for each experiment at 30, 60 and 90 minutes

in 9.3. Impact of Radar Configuration and Scan Strategy on Assimilation of Radar Data using Ensemble Kalman Filter
by Ming Xue, Mingjing Tong, Kelvin K. Droegemeier
"... In PAGE 9: ... 5, together the corre- sponding truth (first row). At this level, where the KTLX radar provides a rather good data coverage (see Table2 ), the differences between the two experiments are relatively small though still identifiable, with the w fields from TLXCYR generally agreeing better with the truth. The differences at the low-levels are much larger.... In PAGE 10: ... 1, Fig. 6 and Table2 ), the quality of analysis is close to that of TLXCYR; in fact, for most variables, the error curves are between those of TLX and TLXCYR (c.... ..."

Table 1. Comparing different pair-based correlation prefetching algorithms running on a ULMT.

in Using a User-Level Memory Thread for Correlation Prefetching
by Yan Solihin, Jaejin Lee , Josep Torrellas
"... In PAGE 6: ....3.4. Comparing the Algorithms Table1 compares the Base, Chain, and Replicated algorithms ex- ecuting on a ULMT. Replicated has the highest potential for high coverage: it supports far-ahead prefetching by prefetching several levels of successors, its prefetches have high accuracy because they prefetch the true MRU successors at each level, and it has a low re- sponse time, in part because it only needs to access a single table row in the Prefetching step.... ..."

Table 1. Comparing different pair-based correlation prefetching algorithms running on a ULMT.

in Using a User-Level Memory Thread for Correlation Prefetching
by Yan Solihin , Jaejin Lee, Josep Torrellas
"... In PAGE 6: ....3.4. Comparing the Algorithms Table1 compares the Base, Chain, and Replicated algorithms ex- ecuting on a ULMT. Replicated has the highest potential for high coverage: it supports far-ahead prefetching by prefetching several levels of successors, its prefetches have high accuracy because they prefetch the true MRU successors at each level, and it has a low re- sponse time, in part because it only needs to access a single table row in the Prefetching step.... ..."

Table 1. Simulated DRAM memory characteristics. DRAM type Chip No of No of banks No of rows Row

in Access Latency Reduction in Contemporary DRAM Memories, Facta Univ
by Vladimir Stanković, Vladimir Stanković 2004
"... In PAGE 6: ... That is the reason why different DRAM memories appear in different result overviews. Table1 and Table 2 show the characteristics of all simulated DRAMs. Columns named Row access and Column access of this table, related to VCDRAM, contain no values, because those are not of interest.... In PAGE 6: ...as kept. The capacity of one item is equal to the second level cache line (128B). The simulated memory bus has 128 data lines and operates on 100MHz. Al- though some memory types (from Table1 and Table 2) may operate on higher frequencies, that cannot be utilized for the adopted bus frequency of 100 MHz. In order all the simulated memories to be able to use this bus optimally, proper organi-... ..."
Cited by 1

Table 1: Data transfer and main memory storage requirements of different cavity detection mapping alternatives on a parallel processor. If the input frame buffers are included, the numbers between () are obtained. Frame transfers are counted per pixel.

in Interaction between Parallel Compilation and Data Transfer and Storage Cost Minimization for Multimedia Applications
by Chidamber Kulkarni, Koen Danckaert, Francky Catthoor, Manish Gupta, Also Ph. D
"... In PAGE 6: ... In this paper, we assume that the image enters and leaves the system in the conventional row-wise fashion. Table1 gives an overview of the reduction of data transfers and the number of memories, accomplished by the different system-level DTSE code transformations. For the initial algorithm, there are 36 accesses per pixel to the frame memory (various frame sizes used are given in figure 4).... ..."

Table 4 Potential growth forecasts: the Czech Republic

in Macroeconomic Developments in the Czech Republic and the EU Accession Process
by Jan Fidrmuc, Jarko Fidrmuc
"... In PAGE 24: ... (1998a). Alternative growth forecasts based on the two approaches are presented in Table4 . The upper part of the table (rows A-C) reports growth projections based on the recovery regression from Table 2, along with the underlying indicators.... In PAGE 25: ...Finally, the lower part of Table4 , rows E and F, reports the values based on the approach utilized by Fischer et al. (1998a), but with the same values for population growth, school enrollment, and initial income as in the upper part of the Table.... In PAGE 25: ...4% according to the Levine-Renelt regression. The variety of growth projections presented in Table4 can be reconciled as follows: The figure reported in row A can be interpreted as the immediate growth potential of the Czech economy (assuming no accession), given the current level of liberalization and demographic characteristics. The figure in row C reflects the medium-term potential, assuming continuing liberalization and further declines in their population growth rates.... In PAGE 26: ... It will also facilitate further economic liberalization. The acceleration of liberalization will have an important effect as can be seen from comparing rows A and B in Table4 . Therefore, row C can be interpreted as the medium-term forecast for growth of the Czech economy (if the current demographic trends continue).... In PAGE 26: ...36 5.19 Note: The no-enlargement scenario projections are based on Table4 , row C for 2000-04 and the average of figures reported in rows E and F for 2005-10. The enlargement scenario assumes that the growth rates will increase by one percentage point after accession.... ..."

Tables Access

in Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions
by Héctor Muñoz-Avila, Frank Weberskirch 1996
Cited by 30

Table Access

in Dynamic Cache Splitting
by Toni Juan Dolors, Toni Juan, Dolors Royo, Juan J. Navarro 1995
Cited by 10

Tables Access

in Retrieving Cases in Structured Domains by Using Goal Dependencies
by Héctor Muñoz-Avila, Jochem Huellen 1995
Cited by 4

Table Access.

in Abstract Implementing an Interpreter for Functional Rules in a Query Optimizer
by Mavis K. Lee, Johann Christoph, Freytag Guy, M. Lohman
Next 10 →
Results 11 - 20 of 11,011
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University