Sciweavers

231 search results - page 8 / 47
» Context Matching for Compressed Terms
Sort
View
DCC
2004
IEEE
14 years 7 months ago
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files
We present a new differential compression algorithm that combines the hash value techniques and suffix array techniques of previous work. Differential compression refers to encodi...
Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Ja...
ICASSP
2011
IEEE
12 years 11 months ago
Optimal structure of memory models for lossless compression of binary image contours
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
Ioan Tabus, Septimia Sarbu
UM
2009
Springer
13 years 12 months ago
History Dependent Recommender Systems Based on Partial Matching
Abstract. This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models rel...
Armelle Brun, Geoffray Bonnin, Anne Boyer
CCS
2003
ACM
14 years 18 days ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
CVPR
2009
IEEE
2452views Computer Vision» more  CVPR 2009»
15 years 2 months ago
CHoG: Compressed Histogram of Gradients: A Low Bit-Rate Feature Descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storag...
Vijay Chandrasekhar (Stanford University), Gabriel...