Sciweavers

21324 search results - page 372 / 4265
» Making the case for computing
Sort
View
ECAL
2001
Springer
15 years 9 months ago
Emergent Syntax: The Unremitting Value of Computational Modeling for Understanding the Origins of Complex Language
Abstract. In this paper we explore the similarities between a mathematical model of language evolution and several A-life simulations. We argue that the mathematical model makes so...
Willem H. Zuidema
JSC
2008
96views more  JSC 2008»
15 years 5 months ago
Computing the algebraic relations of C-finite sequences and multisequences
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
Manuel Kauers, Burkhard Zimmermann
ACRI
2004
Springer
15 years 10 months ago
On the Omni-directional Emergence of Form in Computation
Abstract. I argue for the use of a specific type of grid and computational style for computational simulation that utilize emergence to produce results that would resemble physica...
J. F. Nystrom
CIE
2005
Springer
15 years 10 months ago
Towards Computability of Higher Type Continuous Data
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
Margarita V. Korovina, Oleg V. Kudinov
157
Voted
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
15 years 6 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
Andrew Y. Lindell