Sciweavers

1399 search results - page 97 / 280
» Multi-party Finite Computations
Sort
View
LPAR
2001
Springer
14 years 2 months ago
Boolean Functions for Finite-Tree Dependencies
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
Roberto Bagnara, Enea Zaffanella, Roberta Gori, Pa...
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
COLING
2002
13 years 10 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
JCT
2000
111views more  JCT 2000»
13 years 9 months ago
Immanants and Finite Point Processes
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
Persi Diaconis, Steven N. Evans
SIAMJO
2010
107views more  SIAMJO 2010»
13 years 8 months ago
Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variation
Abstract. This paper concerns second-order analysis for a remarkable class of variational systems in finite-dimensional and infinite-dimensional spaces, which is particularly imp...
René Henrion, Boris S. Mordukhovich, Nguyen...