Sciweavers

1652 search results - page 22 / 331
» Matching Vector Codes
Sort
View
IEEEARES
2008
IEEE
15 years 5 months ago
Matching Policies with Security Claims of Mobile Applications
The Security-by-Contract (S×C) framework has been recently proposed to address the trust relationship problem of the current security model adopted for mobile devices. The key id...
Nataliia Bielova, Marco Dalla Torre, Nicola Dragon...
MICRO
2002
IEEE
173views Hardware» more  MICRO 2002»
15 years 4 months ago
Vector vs. superscalar and VLIW architectures for embedded multimedia benchmarks
Multimedia processing on embedded devices requires an architecture that leads to high performance, low power consumption, reduced design complexity, and small code size. In this p...
Christoforos E. Kozyrakis, David A. Patterson
89
Voted
ICIP
1997
IEEE
16 years 20 days ago
Minimum-Entropy Clustering and its Application to Lossless Image Coding
The Minimum-Entropy Clustering (MEC) algorithm proposed in this paper provides an optimal method for addressing the non-stationarity of a source with respect to entropy coding. Th...
Farshid Golchin, Kuldip K. Paliwal
CASES
2004
ACM
15 years 4 months ago
A hamming distance based VLIW/EPIC code compression technique
This paper presents and reports on a VLIW code compression technique based on vector Hamming distances [19]. It investigates the appropriate selection of dictionary vectors such t...
Montserrat Ros, Peter Sutton
86
Voted
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 3 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan