12052 search results - page 578 / 2411 » computing 2010 |
108
Voted
COLING
2010
15 years 2 months ago
2010
To speed up the process of categorizing learner errors and obtaining data for languages which lack error-annotated data, we describe a linguistically-informed method for generatin...
182
click to vote
FC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract We propose several variants of a secure multiparty computation protocol for AES encryption. The best variant requires 2200 + 400 255 expected elementary operations in expe...
171
click to vote
JLP
2010
15 years 5 months ago
2010
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
175
click to vote
CSR
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
185
Voted
RTA
2010
Springer
15 years 11 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...