681 search results - page 69 / 137 » General Polynomial Time Decomposition Algorithms |
131
Voted
ASAP
2004
IEEE
15 years 4 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
99
Voted
EMNLP
2008
15 years 1 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
99
Voted
CSCW
2012
ACM
13 years 8 months ago
2012
ACM
Preparing complex jobs for crowdsourcing marketplaces requires careful attention to workflow design, the process of decomposing jobs into multiple tasks, which are solved by multi...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...