Sciweavers

153 search results - page 4 / 31
» On the Optimal Compression of Sets in PSPACE
Sort
View
ICASSP
2011
IEEE
14 years 3 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
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
15 years 11 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
HPCA
2008
IEEE
15 years 11 months ago
Performance and power optimization through data compression in Network-on-Chip architectures
The trend towards integrating multiple cores on the same die has accentuated the need for larger on-chip caches. Such large caches are constructed as a multitude of smaller cache ...
Reetuparna Das, Asit K. Mishra, Chrysostomos Nicop...
ICIP
2008
IEEE
15 years 5 months ago
On optimal royalty costs for video compression
Modern video compression includes a mature set of codecs, tools, and techniques that correspond to a variety of coding efficiencies and royalty costs in video delivery. In early ...
Ankur Saxena, Onur G. Guleryuz, M. Reha Civanlar
CADE
2006
Springer
15 years 11 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...