Results 1  10
of
880
The English Noun Phrase in its Sentential Aspect
 PH.D. DISSERTATION MIT
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by a functional element (i.e., "nonlexical" category) D, identified with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by Infl(ection), under ass ..."
Abstract

Cited by 532 (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 VP ing ], by virtue of its exocentricity. Consideration of languages in which nouns, even
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the wellknown Pearl polytree algorithm [12] on a Bayesian network
Semantics and Complexity of SPARQL
"... SPARQL is the standard language for querying RDF data. In this article, we address systematically the formal study of the database aspects of SPARQL, concentrating in its graph pattern matching facility. We provide a compositional semantics for the core part of SPARQL, and study the complexity of th ..."
Abstract

Cited by 277 (25 self)
 Add to MetaCart
be solved more efficiently. This restriction gives rise to the class of welldesigned patterns. We show that the evaluation problem is coNPcomplete for welldesigned patterns. Moreover, we provide several rewriting rules for welldesigned patterns whose application may have a considerable impact
NPCompleteness of Minimum Rule Sets
"... Rule induction systems seek to generate rule sets which are optimal in the complexity of the rule set. This paper develops a formal proof of the NPCompleteness of the problem of generating the simplest rule set (MIN RS) which accurately predicts examples in the training set for a particular type of ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Rule induction systems seek to generate rule sets which are optimal in the complexity of the rule set. This paper develops a formal proof of the NPCompleteness of the problem of generating the simplest rule set (MIN RS) which accurately predicts examples in the training set for a particular type
The Complexity of Stochastic Games
 Information and Computation
, 1992
"... We consider the complexity of stochastic games  simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP " coNP. 1 Introduction We consider the complexity of a natural combinatorial problem ..."
Abstract

Cited by 206 (2 self)
 Add to MetaCart
We consider the complexity of stochastic games  simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP " coNP. 1 Introduction We consider the complexity of a natural combinatorial
The Computational Difficulty of Manipulating an Election
 SOCIAL CHOICE WELFARE
, 1989
"... We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategic manipulation. It is NPcomplete for a manipulative voter to determine how to exploit knowledge of the preferenc ..."
Abstract

Cited by 179 (0 self)
 Add to MetaCart
We show how computational complexity might protect the integrity of social choice. We exhibit a voting rule that efficiently computes winners but is computationally resistant to strategic manipulation. It is NPcomplete for a manipulative voter to determine how to exploit knowledge
Unweighted Coalitional Manipulation Under the Borda Rule Is NPHard
 PROCEEDINGS OF THE TWENTYSECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... The Borda voting rule is a positional scoring rule where, for m candidates, for every vote the first candidate receives m − 1 points, the second m − 2 points and so on. A Borda winner is a candidate with highest total score. It has been a prominent open problem to determine the computational complex ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
The Borda voting rule is a positional scoring rule where, for m candidates, for every vote the first candidate receives m − 1 points, the second m − 2 points and so on. A Borda winner is a candidate with highest total score. It has been a prominent open problem to determine the computational
System BV is NPcomplete
, 2005
"... System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a selfdual, noncommutative logical operator, called seq. While the rules mix and nullary mix extend the deductive system, the operator seq extends the language of MLL. Due to the operator seq, syste ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
System BV is an extension of multiplicative linear logic (MLL) with the rules mix, nullary mix, and a selfdual, noncommutative logical operator, called seq. While the rules mix and nullary mix extend the deductive system, the operator seq extends the language of MLL. Due to the operator seq
Nonexistence of voting rules that are usually hard to manipulate
 IN AAAI
, 2006
"... Aggregating the preferences of selfinterested agents is a key problem for multiagent systems, and one general method for doing so is to vote over the alternatives (candidates). Unfortunately, the GibbardSatterthwaite theorem shows that when there are three or more candidates, all reasonable votin ..."
Abstract

Cited by 88 (8 self)
 Add to MetaCart
hard. This approach has had some limited success, exhibiting rules under which the problem of finding a beneficial manipulation is NPhard, #Phard, or even PSPACEhard. Thus, under these rules, it is unlikely that a computationally efficient algorithm can be constructed that always finds a beneficial
(2) S NP VP
"... The syntactic distribution of a particular lexical item can be determined to some extent by the syntactic category it belongs to. Given the syntactic category of an item, we can predict where in a sentence this item occurs. For instance, if we have a noun like boy in mind, we'll immediately kno ..."
Abstract
 Add to MetaCart
) to be NP and if we have the following phrase structure rules, an N like boy must occur in all NP positions in S.
Results 1  10
of
880