A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
COCOA: Compressed Continuity Analysis for Temporal Databases
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
In this paper we consider the problem of discovering frequent compressed continuity patterns, which have the same power as mining the complete set of frequent continuity patterns. ...
Since it breaks the boundaries of transactions, the number of potential itemsets and the number of rules will increase drastically. ...
In this paper, we proposed the mining of frequent compressed continuities, which has the same power as mining the complete set of frequent continuities. ...
doi:10.1007/978-3-540-30116-5_49
fatcat:ldzj7kt3lndzbishqgbvozoq7a
Implementation of 2D Optimal Barcode (QR Code) for Images
2015
International Journal of Computer Applications Technology and Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The data in image format uses more space. The data capacity can be increased by compressing the data using any of the data compression techniques before encoding. ...
Finally, results are compared with the normal QR Codes to find the efficiency of the new technique of encoding followed by compression for generating optimal QR code. ...
This pattern is actually used for correcting the distortion of the symbol [8] . The central coordinate of the alignment pattern will be identified to correct the distortion of the symbol. ...
doi:10.7753/ijcatr0403.1002
fatcat:w2cnab7fobeyden5x7xa6qnhgm
A Lempel-Ziv like approach for signal classification
2014
TEMA
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, the seminal method proposed by Abraham Lempel and Jacob Ziv, aimed at the complexity analysis of sequences of symbols, was modified to compare similarities between two sequences. ...
This modification allowed the creation of a new criterion which can replace likelihood in some pattern recognition applications. ...
Though the idea of a dictionary of subsequences is not presented in the seminal paper published in 1976 [1] , we believe that it is a powerful point of view for pattern recognition. ...
doi:10.5540/tema.2014.015.02.0223
fatcat:ijnltnxfcjb7dbca3o3fwt5ql4
A 92m W 76.8GOPS vector matching processor with parallel Huffman decoder and query re-ordering buffer for real-time object recognition
2010
2010 IEEE Asian Solid-State Circuits Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, database compression using Huffman coding increases the effective external bandwidth. Dedicated parallel Huffman decoder hardware ensures fast decompression of the database. ...
The main bottleneck of feature-vector matching is the off-chip database access. ...
Database Compression using Huffman Coding The value distribution of SIFT feature vectors in the database, shown in fig. 2 , is well suited for compression by Huffman coding [8] . ...
doi:10.1109/asscc.2010.5716616
fatcat:ri3whszti5ed5adhz2oxm4maa4
Page 12 of The Journal of Information and Image Management Vol. 19, Issue 8
[page]
1986
The Journal of Information and Image Management
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
This level of in- telligence may include limited pattern and symbol recognition of entities re- siding in a very compressed database. ...
This require- ment has created the need for an all- CAD database of drawings within the nuclear power industry. ...
Towards an intelligent database system founded on the SP theory of computing and cognition
2007
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The SP theory of computing and cognition, described in previous publications, is an attractive model for intelligent databases because it provides a simple but versatile format for different kinds of knowledge ...
This paper describes how the SP model can emulate other models used in database applications and compares the SP model with those other models. ...
The responsibility for all errors and oversights is, of course, my own. ...
doi:10.1016/j.datak.2006.04.003
fatcat:56ppvwqctngmbjycwgsiy4xetu
Computing, Cognition and Information Compression
1993
AI Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
of grammars; the organisation of functional, structured, logic and object-oriented computer programs; the application and de-referencing of identifiers in computing; retrieval of information from databases ...
This article develops the idea that the storage and processing of information in computers and in brains may often be understood as information compression. ...
I am also grateful to Graham Stephen for constructive comments on an earlier draft of the article and the correction of some errors. ...
doi:10.3233/aic-1993-6203
fatcat:sg3ivjitpzbgleptnb4ojcaw4m
Compression: a key for next-generation text retrieval systems
2000
Computer
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
By compressing both the complete text and the index, the total amount of space is less than half the size of the original text alone. ...
In this article we discuss recent methods for compressing the text and the index of text retrieval systems. ...
Acknowledgements We wish to acknowledge the many comments of Berthier Ribeiro-Neto and Wagner Meira Jr that helped us to improve this article. ...
doi:10.1109/2.881693
fatcat:joqfo66ltngc7cyaayejlk26cu
CompactDFA: Generic State Machine Compression for Scalable Pattern Matching
2010
2010 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We propose a novel method to compress DFAs by observing that the name of the states is meaningless. ...
This results in a major bottleneck on the throughput of the IDS, as well as its power consumption and cost. ...
The small memory requirement of the compressed rules and the low power consumption enables the usage of multiple TCAMs simultaneously, where each perform pattern matching for different sessions or packets ...
doi:10.1109/infcom.2010.5462160
dblp:conf/infocom/Bremler-BarrHK10
fatcat:h64tngktzbefrhgswvln4pkmte
Energy Efficient Multistandard Decompressor ASIP
2021
2021 7th International Conference on Computing and Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We perform a case study of searching a compressed database dump of the entire English Wikipedia. ...
Many applications make extensive use of various forms of compression techniques for storing and communicating data. ...
The JU receives support from the European Union's Horizon 2020 research and innovation programme and Netherlands, Czech Republic, Finland, Spain, Italy. ...
doi:10.1145/3456172.3456218
fatcat:z6pih7ttkje6xbrtfibtcqjqk4
Symbolic and spatial data analysis: Mining complex data structures
2006
Intelligent Data Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
, potentially useful and understandable patterns in the data. ...
Object oriented databases, and, more recently, object-relational databases allow for the manipulation of data with complex structures, which then require novel methodologies of analysis. ...
Acknowledgements We gratefully acknowledge the remarkable work of the members of the program committee of the workshop. ...
doi:10.3233/ida-2006-10401
fatcat:3riethdrknhednuasj5nsmxmmq
Self-indexed Text Compression Using Straight-Line Programs
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, the problem of operating the grammar in compressed form has not been studied much. ...
Straight-line programs (SLPs) offer powerful text compression by representing a text T [1, u] in terms of a restricted context-free grammar of n rules, so that T can be recovered in O(u) time. ...
We regard this as a foundational result on the extremely important problem of achieving self-indexes built on compression methods potentially more powerful than the current ones [24] . ...
doi:10.1007/978-3-642-03816-7_21
fatcat:ffoakvtmlvbqjdbwlpl7c5stai
An Enhanced Tree Mining Algorithm for Finding Maximal Periodic Movements from Spatiotemporal Databases
2016
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Objectives: To find effective periodic patterns throughthe symbolic database representation of spatiotemporal data by using an efficient algorithm, ETMA (Enhanced Tree-based Mining Algorithm for large ...
The length of the pattern, and proving efficiency of the pruning and searching strategies from synthetic and real datasets is a really open & challenging mining problem. ...
The major objectiveis to design and develop a novel algorithm,whichisaggregated as follows: Firstly, ETMA uses a symbolic representation for compressing the spatial database. ...
doi:10.17485/ijst/2016/v9i41/97038
fatcat:a46ekd2jh5ak7p4bnlgb4azftm
Efficiently decodable and searchable natural language adaptive compression
2005
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We address the problem of adaptive compression of natural language text, focusing on the case where low bandwidth is available and the receiver has little processing power, as in mobile applications. ...
We show that, thanks to the same asymmetry, the receiver can search the compressed text much faster than the plain text. This was previously achieved only in semistatic compression scenarios. ...
The integration of compression and indexing techniques [21, 17, 25] opened the door to compressed text databases, where texts and indexes are manipulated directly in compressed form, and both time and ...
doi:10.1145/1076034.1076076
dblp:conf/sigir/BrisaboaFNP05
fatcat:fw7diimi6fht3kpjrievlthtyy
DATA COMPRESSION USING WIRELESS DISTRIBUTED COMPUTING
2017
International Journal of Advance Engineering and Research Development
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we discuss how we can offload the task of compression onto nearby devices which will save cpu as well as battery resources and also it will reduce the size of file which consumes less storage ...
This may hinder the performance of other applications on the devices. ...
This make consecutive stream of symbols or patterns appear as runs of same (usually 0) symbol. The output is indices of character set. ...
doi:10.21090/ijaerd.rtde16
fatcat:awhfaq4o3rfcrjomrr6weo6odu
« Previous
Showing results 1 — 15 out of 23,771 results