Sciweavers

2066 search results - page 113 / 414
» Word Maturity: Computational Modeling of Word Knowledge
Sort
View
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
14 years 9 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
LICS
2002
IEEE
15 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
SIAMIS
2010
147views more  SIAMIS 2010»
14 years 8 months ago
Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
In image processing, the Rudin-Osher-Fatemi (ROF) model [L. Rudin, S. Osher, and E. Fatemi, Physica D, 60(1992), pp. 259–268] based on total variation (TV) minimization has prove...
Chunlin Wu, Xue-Cheng Tai
BIOSYSTEMS
2008
77views more  BIOSYSTEMS 2008»
14 years 10 months ago
A computational model of chemotaxis-based cell aggregation
We present a computational model that successfully captures the cell behaviors that play important roles in 2-D cell aggregation. A virtual cell in our model is designed as an ind...
Manolya Eyiyurekli, Prakash Manley, Peter I. Lelke...
AML
1998
60views more  AML 1998»
14 years 9 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl