Filters








31,752 Hits in 3.1 sec

The compressed differential heuristic

Meir Goldenberg, Ariel Felner, Alon Palombo, Nathan Sturtevant, Jonathan Schaeffer
2017 AI Communications  
The Compressed Differential Heuristic Meir Goldenberg Nathan Sturtevant Ariel Felner Jonathan Schaeffer  ...  A set of pivot states The differential heuristic (DH) is an effective memory-based P is determined. A DH stores the exact distance from every heuristic for explicit state spaces.  ... 
doi:10.3233/aic-170743 fatcat:nk7za4dqtjcenhejaswo7qunxq

A Heuristic for Finding Compatible Differential Paths with Application to HAS-160 [chapter]

Aleksandar Kircanski, Riham AlTawy, Amr M. Youssef
2013 Lecture Notes in Computer Science  
The heuristic builds on the previous de Cannière and Rechberger automatic differential path search method.  ...  As an application of our proposed heuristic, a second order collision for the full HAS-160 compression function is found.  ...  The authors would like to thank Gaëtan Leurent for his help related to ARXtools and the discussions on the topic.  ... 
doi:10.1007/978-3-642-42045-0_24 fatcat:jmgcgz6fjjapvo2gn4jwgpcfvu

A Literature Review on Quantization Table Design for the JPEG Baseline Algorithm

S.P. Naresh
2016 International Journal Of Engineering And Computer Science  
approach and Meta-Heuristics approach.  ...  Quantization table decides the quality of the encoded image and also controls the amount by which image should be compressed (compression ratio).  ...  Meta-heuristic approaches such as Genetic Algorithm, Particle Swarm Optimization, Differential Evolution, Firefly Algorithm are explained below.  ... 
doi:10.18535/ijecs/v4i10.24 fatcat:65uohdymxnahjcwlnpdbshkkzy

Security Analysis of SIMD [chapter]

Charles Bouillaguet, Pierre-Alain Fouque, Gaëtan Leurent
2011 Lecture Notes in Computer Science  
Finally, in the third part we study differential path in SIMD, and give an upper bound on the probability of related key differential paths.  ...  It allows to distinguish the compression function of SIMD from a random function with a single evaluation.  ...  We would also like to thank Franck Landelle from CELLAR for insightful comments on the security of SIMD and limitations of our initial study of differential paths.  ... 
doi:10.1007/978-3-642-19574-7_24 fatcat:xkn4kasirrbkbpk3fzqccxzxfe

Branching Heuristics in Differential Collision Search with Applications to SHA-512 [chapter]

Maria Eichlseder, Florian Mendel, Martin Schläffer
2015 Lecture Notes in Computer Science  
We achieve our result by improving the branching heuristic of the guess-and-determine approach to find differential characteristics and conforming message pairs.  ...  Experiments show that for smaller problems like 27 steps of SHA-512, the heuristic can also speed up the collision search by a factor of 2 20 .  ...  This corresponds to a complexity of about 2 40.5 evaluations of the SHA-512 compression function.  ... 
doi:10.1007/978-3-662-46706-0_24 fatcat:tvhmu3xwnnerjggztzjiz5jqtq

An Efficient Re-Indexing Algorithm for Color-Mapped Images

S. Battiato, G. Gallo, G. Impoco, F. Stanco
2004 IEEE Transactions on Image Processing  
Many lossless compression algorithms adopt a differential-predictive approach. Hence, if the spatial distribution of the indexes over the image is smooth, greater compression ratios may be obtained.  ...  The proposed technique compares favorably with most of the algorithms proposed in literature, both in terms of computational complexity and of compression ratio.  ...  Hence, finding an optimal indexing scheme is a crucial step for differential lossless compression of indexed images. III.  ... 
doi:10.1109/tip.2004.836183 pmid:15540451 fatcat:sh7r4dmnfvbvva7hn7evtk6mmm

Collaborative broadcasting and compression in cluster-based wireless sensor networks

Anh Tuan Hoang, Mehul Motani
2007 ACM transactions on sensor networks  
We also propose a heuristic scheme which has low complexity and achieves near optimal performance.  ...  We formulate the problem in which sensors in each cluster collaborate their transmitting, receiving, and compressing activities to optimize their lifetimes.  ...  Differential encoding is assumed with a compression ratio of 50%.  ... 
doi:10.1145/1267060.1267065 fatcat:gqa2ukd5r5ej5bkz2hfrfufsau

Techniques for increasing effective data bandwidth

Christopher Nitta, Matthew Farrens
2008 2008 IEEE International Conference on Computer Design  
By using a simple heuristic to classify the contents of a cache line and providing different compression schemes for each classification, we show it is possible to provide overall compression at a cache  ...  compressibility, but that other data types offer more potential for compression.  ...  The best performing compression algorithm differs by each classification when using the Heuristic classification.  ... 
doi:10.1109/iccd.2008.4751909 dblp:conf/iccd/NittaF08 fatcat:g5kk6d6icfb6xfb7ku43ftbu4e

Learning based Facial Image Compression with Semantic Fidelity Metric

Zhibo Chen, Tianyu He
2019 Neurocomputing  
different from the heuristic way of optimization in traditional image compression algorithms.  ...  While either traditional general image codecs or special facial image compression schemes only heuristically refine codec separately according to face verification accuracy metric.  ...  We heuristically set λ con = 0.01, λ sem = 10, λ adv = 0.1 in the experiments.  ... 
doi:10.1016/j.neucom.2019.01.086 fatcat:i4mbyoasrzeazoxara34z237c4

Sparse event detection in wireless sensor networks using compressive sensing

Jia Meng, Husheng Li, Zhu Han
2009 2009 43rd Annual Conference on Information Sciences and Systems  
Finally, we analyze the performance of the compressive sensing algorithms under the Gaussian noise.  ...  In this paper, the first contribution is to formulate the problem for sparse event detection in wireless sensor networks as a compressive sensing problem.  ...  For the updating of α, following the approach in [18] , we differentiate (12) , and then equate it to 0.  ... 
doi:10.1109/ciss.2009.5054713 dblp:conf/ciss/MengLH09 fatcat:a2hlihrorrewthncol5kidtbiu

Page 333 of Political Studies Vol. 14, Issue 3 [page]

1966 Political Studies  
Differentiation must apply to roles at the higher heuristic level of analysis, but may also apply at the lower, more empirical level.!  ...  have thus evolved the concept of compression or compressed differentiation (see Political Mobilization, forthcoming; and with Roland Robertson, ‘Industrialization, Development or Modernization ?’  ... 

A New Searchable Variable-to-Variable Compressor

Nieves R. Brisaboa, Antonio Fariña, Juan R. López, Gonzalo Navarro, Eduardo R. López
2010 2010 Data Compression Conference  
As finding the smallest grammar for a text is NP-complete [6] different heuristics exist. Some examples are LZ78 [20], re-pair [11], and Sequitur [17], among many others [1, 18, 6] .  ...  Additionally, it permits fast searches over the compressed text using Boyer-Moore type algorithms.  ...  Figure 1 shows the compression total file (using gain heuristic) Figure 1 : Compression ratio depending on the parameter minFreq.  ... 
doi:10.1109/dcc.2010.25 dblp:conf/dcc/BrisaboaFLNL10 fatcat:sxoq76xvkfaifg346g6hx2poou

Evaluation of heuristic techniques for test vector ordering

H. Hashempour, F. Lombardi
2004 Proceedins of the 14th ACM Great Lakes symposium on VLSI - GLSVLSI '04  
For this application, it is shown that the best heuristic technique is not the famous Christofides or Lin-Kernighan, but the Multi-Fragment technique.  ...  The latter feature is also important because correlation is captured by coding schemes to efficiently compress test data and ease memory requirements of Automatic-Test-Equipment (ATE), while reducing the  ...  The second heuristic is Lin-Kernighan which has been used in [15] for vector ordering in data compression.  ... 
doi:10.1145/988952.988976 dblp:conf/glvlsi/HashempourL04 fatcat:3jcjgpeofvdkfbs2k6qkl4dy6i

A New Efficient Reordering Algorithm for Color Palette Image

Somaye Akbari Moghadam, Mahnaz Rajabzade, Mohammad Sadeq Garshasbi, Javad Sadri
2013 International Journal of Image Graphics and Signal Processing  
In this paper, we explore a heuristic method to improve the performances on compression ratio. The results indicate that the proposed approach is very effective, acceptable and proved.  ...  The efficiency of lossless compression algorithms for fixed-palette images (indexed images) may change if a different indexing scheme is adopted.  ...  To compress the index sequence, many lossless compression algorithms adopt a differential-predictive approach to encode the index sequence.  ... 
doi:10.5815/ijigsp.2014.01.08 fatcat:pwilobclgbf4ndtvlomeanezne

Supplementary Material from Efficient manipulation and generation of Kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks

Pencho Yordanov, Jörg Stelling
2020 Figshare  
/smallest compression and max is the longest running time/largest compression among all heuristics for the particular example.  ...  The running time and compression were normalized from 0 to 1, using the formula x−min max−min , where x is the running time/compression for every heuristic and example, min is the shortest running time  ... 
doi:10.6084/m9.figshare.12128694.v1 fatcat:4k2ud2w7kjaudodllmoj2t4huy
« Previous Showing results 1 — 15 out of 31,752 results