612 search results - page 82 / 123 » A Computational Grammar for Georgian |
169
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
174
click to vote
HPCC
2007
Springer
16 years 28 days ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
169
click to vote
ESOP
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
158
click to vote
CICLING
2005
Springer
16 years 10 days ago
2005
Springer
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
160
click to vote
DLT
2008
15 years 8 months ago
2008
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...