Results 1  10
of
91
NP MOVEMENT INTO THETAPOSITIONS AND UNEXPECTED BEHAVIOR OF BEHAVIOR OF NUMERAL QUANTIFIER STRANDING*
"... Whether an NP moves into theta position or not has been controversial. Chomsky (1986, 1995) claims that such a movement is disallowed. While Pesetsky (1992) and Bošković (1997) argue that such a movement is possible in ECM construction. Saito (2001), analyzing ..."
Abstract
 Add to MetaCart
Whether an NP moves into theta position or not has been controversial. Chomsky (1986, 1995) claims that such a movement is disallowed. While Pesetsky (1992) and Bošković (1997) argue that such a movement is possible in ECM construction. Saito (2001), analyzing
NPComplete
"... Model of Molecular Computation As do abstract models of all types of computation, a model of molecular computation consists of two components, i.e., a mechanism for data representation (using molecules) and a set of operations on data (i.e., molecules and test cubes). The following model of molecul ..."
Abstract
 Add to MetaCart
of the design of 1 The number is obtained based on the fact that 18 grams of water contains 6.023\Theta10 23...
Big Oh, Big Omega, and Big Theta
"... We consider sequences f: N − → R or f: N − → N or sometimes functions f: R+ − → R. Here N denotes the positive integers, R the real numbers, and R+ the positive real numbers. For asymptotics, we are interested only in the behavior of f(n) for large values of n, so we need only that f be defined for ..."
Abstract
 Add to MetaCart
(n) = o(g(n)) if and only if lim n→∞ f(n) g(n) = 0. The second notation, o(g(n)), is Landau’s “little oh ” notation. For example, if 0 < p < q and b> 1, log n ≺ np ≺ nq ≺ bn. Here is how we denote that f(n) and g(n) have the same rate of growth: f(n) ≍ g(n) if and only if f(n)  ≤ C
Text coherence, complementisers and Theta theory in spoken Frisian
"... Abstract. This article provides an analysis of some fragments of discourse taken from the Corpus Spoken Frisian. It is claimed that the predicateargument relation provides structure to such discourse fragments, provided that the argument position of the predicate can be occupied not just by a NP o ..."
Abstract
 Add to MetaCart
Abstract. This article provides an analysis of some fragments of discourse taken from the Corpus Spoken Frisian. It is claimed that the predicateargument relation provides structure to such discourse fragments, provided that the argument position of the predicate can be occupied not just by a NP
The Diameter of Sparse Random Graphs
, 2004
"... Abstract We derive an expression of the form c ln n \Sigma o(ln n) for the diameter of a sparse random graph with a specified degree sequence. The result holds a.a.s., assuming certain convergence and supercriticality conditions are met. The proof is constructive and yields a method for computing th ..."
Abstract
 Add to MetaCart
the constant c. For the random graph G n;p with np = \Theta (1) + 1, we solve for c in closed form.
Implementing reliable distributed realtime systems with the thetamodel
 In: OPODIS
"... Abstract. A widely accepted viewpoint is that designs for distributed realtime systems should be based on synchronous computational models. Safety in such designs, however, requires that the target system behaves as the synchronous model postulates. We believe that this approach is rather risky, as ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
, as it rests on solving distributed scheduling problems which are known to be NPhard. We therefore advocate the use of more relaxed system models, namely asynchronous models equipped with unreliable failure detectors. To this end, we introduce a novel implementation of the perfect failure detector, resting
Strong NPcompleteness of a Matrix Similarity Problem
"... Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance 1, decide whether there exists a nonsingular matrix G, with condition number bounded by , such that G \Gamma1 AG is 2 \Theta 2 block diagonal. This problem, ..."
Abstract
 Add to MetaCart
Consider the following problem: given an upper triangular matrix A, with rational entries and distinct diagonal elements, and a tolerance 1, decide whether there exists a nonsingular matrix G, with condition number bounded by , such that G \Gamma1 AG is 2 \Theta 2 block diagonal. This problem
On approximate graph colouring and MAXkCUT algorithms based on the θfunction
, 2002
"... The problem of colouring a kcolourable graph is wellknown to be NPcomplete, for k 3. The MAXkCUT approach to approximate kcolouring is to assign k colours to all of the vertices in polynomial time such that the fraction of `defect edges' (with endpoints of the same colour) is provably s ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
The problem of colouring a kcolourable graph is wellknown to be NPcomplete, for k 3. The MAXkCUT approach to approximate kcolouring is to assign k colours to all of the vertices in polynomial time such that the fraction of `defect edges' (with endpoints of the same colour) is provably
NP Completeness of Kauffman's Nk Model, a Tuneably Rugged Fitness Landscape
"... this paper, Prof. Andreas Dress proved my conjecture that \Theta N has maximal size, in that at least one member of \Theta N is fewer than N=2 bit flips away from all N bit strings not in \Theta N . His proof begins by identifying the successive bits b i , for 1 i N of the string S as the image of ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
this paper, Prof. Andreas Dress proved my conjecture that \Theta N has maximal size, in that at least one member of \Theta N is fewer than N=2 bit flips away from all N bit strings not in \Theta N . His proof begins by identifying the successive bits b i , for 1 i N of the string S as the image
A Simplified Proof of the NP and MAX SNPhardness of Multiple Sequence Tree Alignment
 Journal of Computational Biology
, 1995
"... this paper has one or more columns composed purely of indels. The cost of an alignment is generally computed relative to a given \Gamma \Theta \Gamma symmetric matrix ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
this paper has one or more columns composed purely of indels. The cost of an alignment is generally computed relative to a given \Gamma \Theta \Gamma symmetric matrix
Results 1  10
of
91