Sciweavers

6 search results - page 1 / 2
» Minimal Coverings of Maximal Partial Clones
Sort
View
ISMVL
2009
IEEE
88views Hardware» more  ISMVL 2009»
13 years 12 months ago
Minimal Coverings of Maximal Partial Clones
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to...
Karsten Schölzel
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
14 years 2 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...
ICIP
2006
IEEE
14 years 7 months ago
Cover Selection for Steganographic Embedding
The primary goal of image steganography techniques has been to maximize embedding rate while minimizing the detectability of the resulting stego images against steganalysis techni...
Mehdi Kharrazi, Taha Taha Sencar, Nasir D. Memon
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 5 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...