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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,302
Next 10 →

Geometry Compression

by Michael Deering
"... This paper introduces the concept of Geometry Compression, allowing 3D triangle data to be represented with a factor of 6 to 10 times fewer bits than conventional techniques, with only slight losses in object quality. The technique is amenable to rapid decompression in both software and hardware imp ..."
Abstract - Cited by 350 (0 self) - Add to MetaCart
implementations; if 3D rendering hardware contains a geometry decompression unit, application geometry can be stored in memory in compressed format. Geometry is first represented as a generalized triangle mesh, a data structure that allows each instance of a vertex in a linear stream to specify an average of two

Overview of the scalable video coding extension of the H.264/AVC standard

by Heiko Schwarz, Detlev Marpe, Thomas Wiegand - IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY IN CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY , 2007
"... With the introduction of the H.264/AVC video coding standard, significant improvements have recently been demonstrated in video compression capability. The Joint Video Team of the ITU-T VCEG and the ISO/IEC MPEG has now also standardized a Scalable Video Coding (SVC) extension of the H.264/AVC stand ..."
Abstract - Cited by 522 (6 self) - Add to MetaCart
With the introduction of the H.264/AVC video coding standard, significant improvements have recently been demonstrated in video compression capability. The Joint Video Team of the ITU-T VCEG and the ISO/IEC MPEG has now also standardized a Scalable Video Coding (SVC) extension of the H.264/AVC

Reducing Delay With Dynamic Selection of Compression Formats

by Chandra Krintz, Brad Calder - Proceedings of the Tenth IEEE International Symposium on High Performance Distributed Computing , 2001
"... Internet computing is facilitated by the remote execution methodology in which programs transfer to a destination for execution. Since transfer time can substantially degrade performance of remotely executed (mobile) programs, file compression is used to reduce the amount that transfers. Compression ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
. To minimize total delay, a mobile program should be compressed in a format that minimizes total delay. Since both the transfer and decompression time are dependent upon the current, underlying resource performance, selection of the ``best'' format varies and no one compression format minimizes total

Compression Format for IPv6 Datagrams

by J. Hui, Arch Rock Corporation, P. Thubert
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Compression Format for IPv6 Datagrams

by Arch Rock Corporation, P. Thubert
"... ..."
Abstract - Add to MetaCart
Abstract not found

Reducing Delay With Dynamic Selection of Compression Formats

by unknown authors
"... Internet computing is facilitated by the remote execution methodology in which programs transfer to a destination for execution. Since transfer time can substantially degrade performance of remotely executed (mobile) programs, file compression is used to reduce the amount that transfers. Compression ..."
Abstract - Add to MetaCart
. To minimize total delay, a mobile program should be compressed in a format that minimizes total delay. Since both the transfer and decompression time are dependent upon the current, underlying resource performance, selection of the “best ” format varies and no one compression format minimizes total delay

JAZZ: An Efficient Compressed Format for Java Archive Files

by Quetzalcoatl Bradley, R. Nigel Horspool, Jan Vitek , 1998
"... The Jazz file format is intended to be a replacement for the JAR file format when used for storage and distribution of Java programs. A Jazz file is compressed to a degree that far exceeds what is possible with a JAR file. The smaller size of the Jazz format permits faster transmission speeds over a ..."
Abstract - Cited by 34 (0 self) - Add to MetaCart
The Jazz file format is intended to be a replacement for the JAR file format when used for storage and distribution of Java programs. A Jazz file is compressed to a degree that far exceeds what is possible with a JAR file. The smaller size of the Jazz format permits faster transmission speeds over

Querying Large Similar Sequences in a Compressed Format Efficiently

by Xiaochun Yang, Bin Wang, Chen Li, Xiaohui Xie
"... Abstract — With the advances in next-generation sequencing technologies, the amount of genomic sequence data being produced continues to grow at an exponential rate. A unique characteristic of these sequences is that they are over 99 % similar, and therefore highly compressible using their differenc ..."
Abstract - Add to MetaCart
their differences with respect to a reference sequence. Still, an increasingly pressing challenge is how to efficiently query these massive amounts of sequence data in their compressed format. In this paper we study the problem of answering subsequence-search queries on a compressed set of long sequences. We

CSX: An Extended Compression Format for SpMV on Shared Memory Systems

by Kornilios Kourtis, Vasileios Karakasis, Georgios Goumas, Nectarios Koziris
"... The Sparse Matrix-Vector multiplication (SpMV) kernel scales poorly on shared memory systems with multiple processing units due to the streaming nature of its data access pattern. Previous research has demonstrated that an effective strategy to improve the kernel’s performance is to drastically redu ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
reduce the data volume involved in the computations. Since the storage formats for sparse matrices include metadata describing the structure of non-zero elements within the matrix, we propose a generalized approach to compress metadata by exploiting substructures within the matrix. We call the proposed

An Extended Compression Format for the Optimization of Sparse Matrix-Vector Multiplication

by Vasileios Karakasis, Theodoros Gkountouvas, Kornilios Kourtis, Georgios Goumas, Nectarios Koziris
"... Sparse matrix-vector multiplication (SpM×V) has been characterized as one of the most significant computational scientific kernels. The key algorithmic characteristic of the SpM×V kernel, that inhibits it from achieving high performance, is its very low flop:byte ratio. In this paper, we present an ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
an extended and integrated compressed storage format, called Compressed Sparse eXtended (CSX), that is able to detect and encode simultaneously multiple commonly encountered substructures inside a sparse matrix. Relying on aggressive compression techniques of the sparse matrix’s indexing structure, CSX
Next 10 →
Results 1 - 10 of 3,302
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