Results 1  10
of
124,549
NP Subject Detection in VerbInitial Arabic Clauses
"... Phrase reordering is a wellknown obstacle to robust machine translation for language pairs with significantly different word orderings. For ArabicEnglish, two languages that usually differ in the ordering of subject and verb, the subject and its modifiers must be accurately moved to produce a gra ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Phrase reordering is a wellknown obstacle to robust machine translation for language pairs with significantly different word orderings. For ArabicEnglish, two languages that usually differ in the ordering of subject and verb, the subject and its modifiers must be accurately moved to produce a
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 523 (3 self)
 Add to MetaCart
CalabiYau manifolds V, W of dimension n (not necessarily equal to 3) one has dim H p (V, Ω q) = dim H n−p (W, Ω q). Physicists conjectured that conformal field theories associated with mirror varieties are equivalent. Mathematically, MS is considered now as a relation between numbers of rational curves
NP
"... Full list of author information is available at the end of the articledeeply in body. For these reasons information about the safety and potential hazards of ZnO NPs is required. ZnO NPs is considered as one of the most toxic NPs with the lowest LD50 value among the engineered metal oxide nanopartic ..."
Abstract
 Add to MetaCart
Full list of author information is available at the end of the articledeeply in body. For these reasons information about the safety and potential hazards of ZnO NPs is required. ZnO NPs is considered as one of the most toxic NPs with the lowest LD50 value among the engineered metal oxide nanoparticles [6]. To date several studies provided ample evidence that ZnO NPs distributed mainly in the timal viability assay for using with ZnO NPs in order to assess their toxicity to the liver and kidney cells. In this paper, we have evaluated the toxicity of ZnO NPs and analyzed cellular morphology, cellular viability, oxidative stress, and DNA damage in ZnO NPstreated cells. Methods Cell culture and treatment
Minimumenergy broadcast in allwireless networks: Npcompleteness and distribution
 In Proc. of ACM MobiCom
, 2002
"... In allwireless networks a crucial problem is to minimize energy consumption, as in most cases the nodes are batteryoperated. We focus on the problem of poweroptimal broadcast, for which it is well known that the broadcast nature of the radio transmission can be exploited to optimize energy consump ..."
Abstract

Cited by 177 (2 self)
 Add to MetaCart
consumption. Several authors have conjectured that the problem of poweroptimal broadcast is NPcomplete. We provide here a formal proof, both for the general case and for the geometric one; in the former case, the network topology is represented by a generic graph with arbitrary weights, whereas
Computational Limitations on Learning from Examples
 Journal of the ACM
, 1988
"... Abstract. The computational complexity of learning Boolean concepts from examples is investigated. It is shown for various classes of concept representations that these cannot be learned feasibly in a distributionfree sense unless R = NP. These classes include (a) disjunctions of two monomials, (b) ..."
Abstract

Cited by 214 (10 self)
 Add to MetaCart
) Boolean threshold functions, and (c) Boolean formulas in which each variable occurs at most once. Relationships between learning of heuristics and finding approximate solutions to NPhard optimization problems are given. Categories and Subject Descriptors: F. 1.1 [Computation by Abstract Devices]: Models
Concealed questions and specificational subjects
 Linguistics and Philosophy
, 2005
"... This paper is concerned with Noun Phrases (NPs, henceforth) occurring in two constructions: concealed question NPs and NP subjects of specificational sentences. The first type of NP is illustrated in (1). The underlined NPs in (1) have been called ‘concealed questions ’ because sentences that embed ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
This paper is concerned with Noun Phrases (NPs, henceforth) occurring in two constructions: concealed question NPs and NP subjects of specificational sentences. The first type of NP is illustrated in (1). The underlined NPs in (1) have been called ‘concealed questions ’ because sentences that embed
NP S VP
"... = a language in which constituent structure reflects grammatical functions, with the subject under S and the object under VP. ..."
Abstract
 Add to MetaCart
= a language in which constituent structure reflects grammatical functions, with the subject under S and the object under VP.
Robust discrete optimization and network flows
 Mathematical Programming Series B
, 2003
"... We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows controlling the degree of conservatism of the solution, and is computationally tractable both practically and theoretically. In particular, when both the cost coefficients and the data ..."
Abstract

Cited by 194 (27 self)
 Add to MetaCart
in the constraints of an integer programming problem are subject to uncertainty, we propose a robust integer programming problem of moderately larger size that allows controlling the degree of conservatism of the solution in terms of probabilistic bounds on constraint violation. When only the cost coefficients
Hardness Amplification within NP
, 2002
"... In this paper we investigate the following question: If NP is slightly hard on average, is it very hard on average? We show the answer is yes; if there is a function in NP which is infinitely often balanced and (11/poly(n))hard for circuits of polynomial size, then there is a function in NP which ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
In this paper we investigate the following question: If NP is slightly hard on average, is it very hard on average? We show the answer is yes; if there is a function in NP which is infinitely often balanced and (11/poly(n))hard for circuits of polynomial size, then there is a function in NP which
Results 1  10
of
124,549