1450 search results - page 123 / 290 » On the Complexity of Hardness Amplification |
ICASSP
2011
IEEE
13 years 27 days ago
2011
IEEE
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
ICASSP
2011
IEEE
13 years 27 days ago
2011
IEEE
Unit selection synthesis inventories have coverage issues, which lead to missing syllable or diphone units. In the conventional back-off strategy of substituting the missing unit ...
AMW
2011
13 years 24 days ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
IACR
2011
12 years 8 months ago
2011
Search for cryptographic keys in RAM is a new and prospective technology which can be used, primarily, in the computer forensics. In order to use it, a cryptanalyst must solve, at...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...