74 search results - page 4 / 15 » Combination Can Be Hard: Approximability of the Unique Cover... |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
BMCBI
2006
13 years 7 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
HEURISTICS
2006
13 years 7 months ago
2006
Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework f...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
ISCAS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...