Sciweavers

8780 search results - page 1718 / 1756
» On the Feasibility of Consistent Computations
Sort
View
ACL
1997
13 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
FTCS
1997
115views more  FTCS 1997»
13 years 11 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman
NIPS
2000
13 years 11 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek
IJCAI
1997
13 years 11 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
WSC
1998
13 years 11 months ago
Customer Interfacing - Lessons Learned
Customer interfacing is the process through which one works with and relates to their customer. Often in the technical world, modelers find it easier to interface with computers r...
David M. Ferrin, Richard P. Lavecchia
« Prev « First page 1718 / 1756 Last » Next »