6568 search results - page 163 / 1314 » Reducing the Complexity of Reductions |
175
click to vote
COLING
2010
15 years 1 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
185
click to vote
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
In this paper, we describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on byte-oriented symmetric primitives. To demonstrate ...
167
click to vote
ICCD
2002
IEEE
15 years 11 months ago
2002
IEEE
The exceedingly large size of fault dictionaries constitutes a fundamental obstacle to their usage. We outline a new method to reduce significantly the size of fault dictionaries...
168
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
211
click to vote
DEXAW
2007
IEEE
15 years 10 months ago
2007
IEEE
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...