Results 1  10
of
848,335
The English noun phrase in its sentential aspect
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under assump ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
phrases. The problem of capturing this dual aspect of the Possing construction is heightened by current restrictive views of Xbar theory, which, in particular, rule out the obvious structure for Possing, [NP NP VPing], by virtue of its exocentricity. Consideration of languages in which nouns, even
The XBar Theory Of Phrase Structure
, 1990
"... this paper we will demonstrate that a formalization of its content reveals very little substance in its claims. We state and discuss six conditions that encapsulate the claims of Xbar theory: ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
this paper we will demonstrate that a formalization of its content reveals very little substance in its claims. We state and discuss six conditions that encapsulate the claims of Xbar theory:
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Lexical Categories and XBar Features
"... this paper. Another, and perhaps even more important problem area is the definition of words.The classical definition `maximal domains between potential pauses' appeals directly to the intuition of the speakers: this can be supplemented by the investigation of the domains of various phonologica ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
phonological processes like stress placement, vowel harmony, etc. The phonological words defined this way usually happen to be (1) A) minimal free forms (Bloomfield 1926) B) maximal stable forms (Bloch, cited in Hockett 1958:19.4) C) maximal fixed internal order domains (see e.g. Matthews 1974:162ff) D
1 THE XBAR STATUS OF NEG
"... In Standard Arabic negative sentences, the negative morpheme carries tense and manifests the following alternation depending on the type of tense: (1) a. rrijaalu qaam.uu themennom stood.upAgr "The men stood up." b. rrijaalu lam yaquumuu themennom notpast impstand.upAgr &qu ..."
Abstract
 Add to MetaCart
EFFECT OF NEG Suppose, then, that the sentences in (1) all instantiate a structure in which Neg heads a NegP projection which is Cselected by Tense. The prediction that should follow from this hypothesis is the familiar phenomenon that the verb cannot move to T across the negative head: 2 Albayaty
Computational LambdaCalculus and Monads
, 1988
"... The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise the ..."
Abstract

Cited by 505 (7 self)
 Add to MetaCart
The calculus is considered an useful mathematical tool in the study of programming languages, since programs can be identified with terms. However, if one goes further and uses fijconversion to prove equivalence of programs, then a gross simplification 1 is introduced, that may jeopardise
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Sorting networks and their applications
, 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract

Cited by 660 (0 self)
 Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing
Results 1  10
of
848,335