Relevant bibliographies by topics / Block Size of Data

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Block Size of Data'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Block Size of Data.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Block Size of Data"

1

Taima, Masahiro, Yasushi Asami, and Kimihiro Hino. "Estimation of building shape by block size." Abstracts of the ICA 1 (July 15, 2019): 1–2. http://dx.doi.org/10.5194/ica-abs-1-360-2019.

Full text
Abstract:
<p><strong>Abstract.</strong> Block restructuring has been strongly emphasized in Japan for renovating cities. However, little is known about the relation between block size and building shape. Moreover, the shape of buildings designed on a block after restructuring is unclear. Some estimation methods for urban physical status, such as building footprint location, floor area, and land use, have been developed in previous research. Taima et al. (2016) developed a model to estimate the building footprint area by using GIS. The future image of the building footprint on various b
APA, Harvard, Vancouver, ISO, and other styles
2

Taima, Masahiro, Yasushi Asami, and Kimihiro Hino. "The relation between block size and building shape." Environment and Planning B: Urban Analytics and City Science 46, no. 1 (2017): 103–21. http://dx.doi.org/10.1177/2399808317702897.

Full text
Abstract:
Block restructuring has been strongly emphasized in Japan for renovating cities. However, little is known about the relation between block size and building shape. Moreover, the shape of buildings designed on a block after restructuring is unclear. In this study, the relation between block size and building shape is analyzed quantitatively, and a three-dimensional building shape is estimated by a model using an urban planning GIS data set of Tokyo. Results show the quantitative relation between block size and building shape, and the building shape image on the blocks. Higher buildings and buil
APA, Harvard, Vancouver, ISO, and other styles
3

Viji, D., and Dr S. Revathy. "Comparative Analysis for Content Defined Chunking Algorithms in Data Deduplication." Webology 18, Special Issue 02 (2021): 255–68. http://dx.doi.org/10.14704/web/v18si02/web18070.

Full text
Abstract:
Data deduplication works on eliminating redundant data and reducing storage consumption. Nowadays more data generated and it was stored in the cloud repeatedly, due to this large volume of storage will be consumed. Data deduplication tries to reduce data volumes disk space and network bandwidth can be to reduce costs and energy consumption for running storage systems. In the data deduplication method, data broken into small size of chunk or block. Hash ID will be calculated for all the blocks then it’s compared with existing blocks for duplication. Blocks may be fixed or variable size, compare
APA, Harvard, Vancouver, ISO, and other styles
4

Kvet, Michal, and Karol Matiasko. "Data Block and Tuple Identification Using Master Index." Sensors 20, no. 7 (2020): 1848. http://dx.doi.org/10.3390/s20071848.

Full text
Abstract:
Relational databases are still very often used as a data storage, even for the sensor oriented data. Each data tuple is logically stored in the table referenced by relationships between individual tables. From the physical point of view, data are stored in the data files delimited by the tablespaces. Files are block-oriented. When retrieving data, particular blocks must be identified and transferred into the memory for the evaluation and processing. This paper deals with storage principles and proposes own methods for effective data block location and identification if no suitable index for th
APA, Harvard, Vancouver, ISO, and other styles
5

Jain, Neeraj Kumar, and Singara Singh Kasana. "High-Capacity Reversible Data Hiding Using Modified Pixel Value Ordering Approach." Journal of Circuits, Systems and Computers 27, no. 11 (2018): 1850175. http://dx.doi.org/10.1142/s021812661850175x.

Full text
Abstract:
The proposed reversible data hiding technique is the extension of Peng et al.’s technique [F. Peng, X. Li and B. Yang, Improved PVO-based reversible data hiding, Digit. Signal Process. 25 (2014) 255–265]. In this technique, a cover image is segmented into nonoverlapping blocks of equal size. Each block is sorted in ascending order and then differences are calculated on the basis of locations of its largest and second largest pixel values. Negative predicted differences are utilized to create empty spaces which further enhance the embedding capacity of the proposed technique. Also, the already
APA, Harvard, Vancouver, ISO, and other styles
6

Kasana, Geeta, Kulbir Singh, and Satvinder Singh Bhatia. "Block-Based High Capacity Multilevel Image Steganography." Journal of Circuits, Systems and Computers 25, no. 08 (2016): 1650091. http://dx.doi.org/10.1142/s0218126616500912.

Full text
Abstract:
This paper proposes a block-based high capacity steganography technique for digital images. The cover image is decomposed into blocks of equal size and the largest pixel of each block is found to embed the secret data bits and also the smallest pixel of each block is used for embedding to enhance the capacity. Embedding of secret data is performed using the concept that the pixel of a cover image has only two states — even and odd. Multilevel approach is also combined in the proposed technique to achieve high embedding capacity. In order to make the proposed technique more secure, a key is gen
APA, Harvard, Vancouver, ISO, and other styles
7

Mukherjee, Prasita, Sourasekhar Banerjee, and Asoke Nath. "Data Hiding Algorithm using Variable Block Size in Cover Image File." International Journal of Computer Applications 89, no. 13 (2014): 11–20. http://dx.doi.org/10.5120/15690-4559.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Xu, Li-Yao Li, Ching-Chun Chang, and Chih-Cheng Chen. "High-Capacity Reversible Data Hiding in Encrypted Images Based on Prediction Error Compression and Block Selection." Security and Communication Networks 2021 (June 30, 2021): 1–12. http://dx.doi.org/10.1155/2021/9606116.

Full text
Abstract:
The popularity of cloud computing has impelled more users to upload personal data into the cloud server. The need for secure transmission and privacy protection has become a new challenge and has attracted considerable attention. In this paper, we propose a high-capacity reversible data hiding scheme in encrypted images (RDHEI) that compresses prediction errors in usable blocks of block-based encrypted images. On the content owner side, the original image is divided into 2 × 2 sized blocks, and each block is encrypted by block-based modulation. On the data hider side, an efficient block-based
APA, Harvard, Vancouver, ISO, and other styles
9

De Biagi, Valerio, Maria Lia Napoli, Monica Barbero, and Daniele Peila. "Estimation of the return period of rockfall blocks according to their size." Natural Hazards and Earth System Sciences 17, no. 1 (2017): 103–13. http://dx.doi.org/10.5194/nhess-17-103-2017.

Full text
Abstract:
Abstract. With reference to the rockfall risk estimation and the planning of rockfall protection devices, one of the most critical and most discussed problems is the correct definition of the design block by taking into account its return period. In this paper, a methodology for the assessment of the design block linked with its return time is proposed and discussed, following a statistical approach. The procedure is based on the survey of the blocks that were already detached from the slope and had accumulated at the foot of the slope in addition to the available historical data.
APA, Harvard, Vancouver, ISO, and other styles
10

Praptanto, Dwi Dian, Kurnia Herlina Dewi, and Bosman Sidebang. "STUDY ON WET PROCESSING OF BLOCK CHILLY." Jurnal Agroindustri 3, no. 1 (2013): 45–50. http://dx.doi.org/10.31186/j.agroind.3.1.45-50.

Full text
Abstract:
The purpose of this study is to examine the effect of drying time in weight and water content, combination effect of drying time and size of the material, and consumer acceptance to the product in the wet processing of chili blocks production. Method used in the research is completely randomized design (CRD) with two factorials are material size and drying time. Data were analyzed using ANOVA and further analysis using DMRT at 5% significance level. Organoleptic test result was analyzed using the Kruskal-Wallis and Tukey test for further analysis. Application of the equal drying time to two di
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Block Size of Data"

1

Annavarapu, Srikant. "Estimating Primary Fragment Size Distributions from Drill Hole Data." Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/293750.

Full text
Abstract:
The assessment of fragmentation is an important aspect of the design and planning of any excavation. The distribution of fragment sizes in situ helps assess the requirement of explosive energy to excavate the rock material. In addition, the information can also be used to evaluate the ground water flow, leaching characteristics and the requirement of additional rock handling equipment in construction projects. In the block cave mining method, the assessment of in situ and secondary fragmentation is an integral part of the design of the excavations at the extraction level and the selection o
APA, Harvard, Vancouver, ISO, and other styles
2

Mandhapati, Venkata Srikanth, and Kamran Ali Bajwa. "Evaluation of Idempotency & Block Size of Data on the Performance of Normalized Compression Distance Algorithm." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4303.

Full text
Abstract:
Normalized compression distance (NCD) is a similarity distance metric algorithm which is used for the purpose of analyzing the type of file fragments. The performance of NCD depends upon underlying compression algorithm to be used. We have studied three compressors bzip2, gzip and ppmd, the compression ratio of ppmd is better than bzip2 and the compression ratio of bzip2 is better than gzip, but which one out of these three is better than one another in the viewpoint of idempotency is evaluated by us. Then we have applied NCD along with k nearest neighbour as a classification algorithm to a ra
APA, Harvard, Vancouver, ISO, and other styles
3

Fakhouri, Elie Michel. "Variable block-size motion estimation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ37260.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sodagari, Shabnam. "Variable block-size disparity estimation in stereo imagery." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26399.

Full text
Abstract:
This thesis addresses the problem of developing and implementing in software a variable block size (quadtree splitting) disparity estimation algorithm that is optimized for use in compression of stereo image pairs and studying its performance over a range of rate/distortion values for a variety of images. First the constrained optimization problem is converted to an unconstrained one using the Lagrange multiplier approach. Then by solving the optimization problem using dynamic programming, the optimal variables representing the optimal quadtree structure and the quantizer for each node are det
APA, Harvard, Vancouver, ISO, and other styles
5

Gamachchige, Nirosh Tharaka Sandakelum Gangoda. "Double-Change Covering Designs with Block Size k = 4." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1423.

Full text
Abstract:
A double-change covering design (dccd) is an ordered set of blocks with block size k is an ordered collection of b blocks, B = {B1,B2, · · · ,Bb}, each an unordered subset of k distinct elements from [v] = {1, 2, · · · , v}, which obey: (1) each block differs from the previous block by two elements, and, (2) every unordered pair of [v] appears in at least one block. The object is to minimize b for a fixed v and k. Tight designs are those in which each pair is covered exactly once. We present constructions of tight dccd’s for arbitrary v when k = 2 and minimal constructions for v <= 20 when k =
APA, Harvard, Vancouver, ISO, and other styles
6

Jensen, Jonathan C. "Ultra-high speed data converter building blocks in Si/SiGe HBT process." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2005. http://wwwlib.umi.com/cr/ucsd/fullcit?p3190137.

Full text
Abstract:
Thesis (Ph. D.)--University of California, San Diego, 2005.<br>Title from first page of PDF file (viewed October 11, 2006). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 102-109).
APA, Harvard, Vancouver, ISO, and other styles
7

Moffitt, Matthew. "Nanoparticle size control and coronal structure in block ionomer micelles." Thesis, McGill University, 1997. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=35015.

Full text
Abstract:
Quantum-confined semiconductors have been synthesized in ionomer microdomains, demonstrating thermodynamic control of nanoparticle sizes via a priori knowledge of ion aggregation numbers. In block ionomers, cadmium sulfide (CdS) nanoparticle sizes are found to scale with the ionic block length (N B) as NB3/5. CdS-polymer composites from block ionomers can be suspended in organic solvents as reverse micelles. Micelle stability is improved by reneutralization of acrylic acid blocks surrounding the nanoparticle. Reloading of microreactors and controlled continued growth of nanoparticles is demons
APA, Harvard, Vancouver, ISO, and other styles
8

Moffitt, Matthew. "Nanoparticle size control and coronal structure in block ionomer micelles." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0015/NQ44517.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wien, Mathias [Verfasser]. "Variable Block-Size Transforms for Hybrid Video Coding / Mathias Wien." Aachen : Shaker, 2004. http://d-nb.info/1172614245/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Urban, Michael G. "Voyager Image Data Compression and Block Encoding." International Foundation for Telemetering, 1987. http://hdl.handle.net/10150/615317.

Full text
Abstract:
International Telemetering Conference Proceedings / October 26-29, 1987 / Town and Country Hotel, San Diego, California<br>Telemetry enhancement techniques implemented through flight software modifications and utilization of special flight hardware enable the Voyager 2 spacecraft to reduce telemetry transmission rates used at Saturn by over 50% for the extended mission to Uranus and Neptune with negligible loss in information return. Techniques employed include: * Parallel operation of the redundant Flight Data Subsystem (FDS) processors * Image Data Compressor (IDC) using noiseless (fully rec
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Block Size of Data"

1

Henry, Greg. BLAS based on block data structures. Cornell Theory Center, Cornell University, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Knudsen, Lars. The Block Cipher Companion. Springer-Verlag Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Farrelle, Paul Michael. Recursive Block Coding for Image Data Compression. Springer New York, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Recursive block coding for image data compression. Springer-Verlag, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Farrelle, Paul Michael. Recursive Block Coding for Image Data Compression. Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-9676-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Burns, Emily. Hydrologic data for Block Island, Rhode Island. U.S. Dept. of the Interior, U.S. Geological Survey, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

1938-, Herrendörfer Günter, ed. Experimental design: Sample size determination and block designs. D. Reidel Pub. Co., 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Moldovyan, Nick. Data-driven block ciphers for fast telecommunication systems. Auerbach Publications, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dinkevich, Solomon. Explicit block diagonal decomposition of block matrices corresponding to symmetric and regular structures of finite size. Courant Institute of Mathematical Sciences, New York University, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Provder, Theodore, ed. Detection and Data Analysis in Size Exclusion Chromatography. American Chemical Society, 1987. http://dx.doi.org/10.1021/bk-1987-0352.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Block Size of Data"

1

Lahiri, S. N. "Empirical Choice of the Block Size." In Resampling Methods for Dependent Data. Springer New York, 2003. http://dx.doi.org/10.1007/978-1-4757-3803-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Latesh Kumar, K. J., and R. Lawrance. "Novel Approach: Deduplication for Backup Systems Using Data Block Size." In Computational Intelligence in Data Mining - Volume 1. Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-2205-7_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Yuxiong, Yujuan Tan, Congcong Xu, et al. "AIR Cache: A Variable-Size Block Cache Based on Fine-Grained Management Method." In Web and Big Data. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85899-5_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Weik, Martin H. "block size." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_1726.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nahler, Gerhard. "block size." In Dictionary of Pharmaceutical Medicine. Springer Vienna, 2009. http://dx.doi.org/10.1007/978-3-211-89836-9_134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tian, Runjia. "Suggestive Site Planning with Conditional GAN and Urban GIS Data." In Proceedings of the 2020 DigitalFUTURES. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-33-4400-6_10.

Full text
Abstract:
AbstractIn architecture, landscape architecture, and urban design, site planning refers to the organizational process of site layout. A fundamental step for site planning is the design of building layout across the site. This process is hard to automate due to its multi-modal nature: it takes multiple constraints such as street block shape, orientation, program, density, and plantation. The paper proposes a prototypical and extensive framework to generate building footprints as masterplan references for architects, landscape architects, and urban designers by learning from the existing built environment with Artificial Neural Networks. Pix2PixHD Conditional Generative Adversarial Neural Network is used to learn the mapping from a site boundary geometry represented with a pixelized image to that of an image containing building footprint color-coded to various programs. A dataset containing necessary information is collected from open source GIS (Geographic Information System) portals from the city of Boston, wrangled with geospatial analysis libraries in python, trained with the TensorFlow framework. The result is visualized in Rhinoceros and Grasshopper, for generating site plans interactively.
APA, Harvard, Vancouver, ISO, and other styles
7

Weik, Martin H. "fixed-size block." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_7264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Anitha, U., and S. Malarkkan. "Analysis of Edge Detection Techniques for Side Scan Sonar Image Using Block Processing and Fuzzy Logic Methods." In Proceedings of the International Conference on Data Engineering and Communication Technology. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-1678-3_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Politis, Dimitris N., Joseph P. Romano, and Michael Wolf. "Choice of the Block Size." In Springer Series in Statistics. Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1554-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Salomon, David. "Block Ciphers." In Data Privacy and Security. Springer New York, 2003. http://dx.doi.org/10.1007/978-0-387-21707-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Block Size of Data"

1

Constantinescu, Cornel, Jan Pieper, and Tiancheng Li. "Block Size Optimization in Deduplication Systems." In 2009 Data Compression Conference (DCC). IEEE, 2009. http://dx.doi.org/10.1109/dcc.2009.51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ahir, Trupti, and R. V. S. Satyanrayana. "Quality controlled image compressor using tiny block size encoding cellular automata." In 2017 International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS). IEEE, 2017. http://dx.doi.org/10.1109/icecds.2017.8389789.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Waidyasooriya, Hasitha Muthumala, Daisuke Ono, and Masanori Hariyama. "Hardware-oriented succinct-data-structure based on block-size-constrained compression." In 2015 7th International Conference of Soft Computing and Pattern Recognition (SoCPaR). IEEE, 2015. http://dx.doi.org/10.1109/socpar.2015.7492797.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Keissarian, Farhad. "Using a Novel Variable Block Size Image Compression Algorithm for Hiding Secret Data." In 2008 IEEE International Conference on Signal Image Technology and Internet Based Systems (SITIS). IEEE, 2008. http://dx.doi.org/10.1109/sitis.2008.82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fang, Juan, Kuan Zhou, Chen Tan, and Hui Zhao. "Dynamic Block Size Adjustment and Workload Balancing Strategy Based on CPU-GPU Heterogeneous Platform." In 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom). IEEE, 2019. http://dx.doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Repetto-Llamazares, Ada H. V., Ove T. Gudmestad, Arne Gu¨rtner, and Knut V. Ho̸yland. "Shoulder Ice Barrier Ice Tank Testing—Part II: Estimation of Breaking Length and Block Size Using Image Analysis." In ASME 2009 28th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2009. http://dx.doi.org/10.1115/omae2009-79140.

Full text
Abstract:
When studying ice interaction on sloped structures, a key parameter that is usually reported after experiments and observations either in Full Scale or Model Scale is the breaking length associated with the ice failure. Moreover, either for numerical modeling or load calculations the size of the blocks generated during ice-structure interaction that accumulates rubble is of importance. In this paper, the technique of image analysis has been used to obtain values of the breaking length and the ice block sizes generated during model tests of a Shoulder Ice Barrier (SIB)-ice interaction. The mode
APA, Harvard, Vancouver, ISO, and other styles
7

Parandeh-Afshar, H., P. Brisk, and P. Ienne. "Scalable and low cost design approach for variable block size motion estimation (VBSME)." In 2009 International Symposium on VLSI Design, Automation and Test (VLSI-DAT). IEEE, 2009. http://dx.doi.org/10.1109/vdat.2009.5158147.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jia, Luheng, Chi-ying Tsui, Oscar C. Au, and Amin Zheng. "A fast variable block size motion estimation algorithm with refined search range for a two-layer data reuse scheme." In 2015 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2015. http://dx.doi.org/10.1109/iscas.2015.7168856.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Fisher, Jeffrey, Peter Christen, Qing Wang, and Erhard Rahm. "A Clustering-Based Framework to Control Block Sizes for Entity Resolution." In KDD '15: The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2015. http://dx.doi.org/10.1145/2783258.2783396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Song, Yang, Zhenyu Liu, Takeshi Ikenaga, and Satoshi Goto. "VLSI Architecture for Variable Block Size Motion Estimation in H.264/AVC with Low Cost Memory Organization." In 2006 International Symposium on VLSI Design, Automation and Test (VLSI-DAT). IEEE, 2006. http://dx.doi.org/10.1109/vdat.2006.258131.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Block Size of Data"

1

Morozov, Dmitriy, and Tom Peterka. Block-Parallel Data Analysis with DIY2. Office of Scientific and Technical Information (OSTI), 2017. http://dx.doi.org/10.2172/1377403.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Soltz, R., P. Vranas, and R. Gupta. Lattice QCD Thermodynamics : 10k analysis with 1k thermalziation and block size of 500. Office of Scientific and Technical Information (OSTI), 2007. http://dx.doi.org/10.2172/908125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dubnicki, Cezary. The Effects of Block Size on the Performance of Coherent Caches in Shared-Memory Multiprocessors. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada272838.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Glassley, W. ,. LLNL. Preliminary description of small block mineralogical features, data report. Office of Scientific and Technical Information (OSTI), 1998. http://dx.doi.org/10.2172/672204.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sumit Mukhopadhyay. Understanding the Irregular Data from the Large Block Test. Office of Scientific and Technical Information (OSTI), 2001. http://dx.doi.org/10.2172/787038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Barker, W. C., and E. B. Barker. Recommendation for the triple data encryption algorithm (TDEA) block cipher. National Institute of Standards and Technology, 2012. http://dx.doi.org/10.6028/nist.sp.800-67r1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Barker, Elaine, and Nicky Mouha. Recommendation for the Triple Data Encryption Algorithm (TDEA) block cipher. National Institute of Standards and Technology, 2017. http://dx.doi.org/10.6028/nist.sp.800-67r2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Barker, W. C. Recommendation for the triple data encryption algorithm (TDEA) block cipher. National Institute of Standards and Technology, 2004. http://dx.doi.org/10.6028/nist.sp.800-67ver1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cheng, P., Th Toutin, Y. Zhang, and M. Wood. QuickBird...Geometric Correction, Path and Block Processing and Data Fusion. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 2003. http://dx.doi.org/10.4095/220038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barker, W. C. Recommendation for the triple data encryption algorithm (TDEA) block cipher. National Institute of Standards and Technology, 2004. http://dx.doi.org/10.6028/nist.sp.800-67v1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography