Sciweavers

1220 search results - page 78 / 244
» Restricting grammatical complexity
Sort
View
ACL
1998
13 years 9 months ago
Syntactic and Semantic Transfer with F-Structures
We present two approaches for syntactic and semantic transfer based on LFG f-structures and compare the results with existing co-description and restriction operator based approac...
Michael Dorna, Anette Frank, Josef van Genabith, M...
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 9 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Quantum walk based search algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Amba...
Miklos Santha
IJAR
2008
106views more  IJAR 2008»
13 years 7 months ago
Probabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
Fabio Gagliardi Cozman, Cassio Polpo de Campos, Jo...
CORR
2007
Springer
78views Education» more  CORR 2007»
13 years 7 months ago
Hybrid Branching-Time Logics
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Volker Weber