1399 search results - page 179 / 280 » Multi-party Finite Computations |
124
click to vote
COLING
2010
14 years 11 months ago
2010
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
243
click to vote
COMMA
2010
14 years 11 months ago
2010
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
142
click to vote
DCC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
160
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
148
click to vote
TCS
2010
14 years 11 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...