Results 1  10
of
373
Resource Description Framework (RDF) Model and Syntax Specification
, 1998
"... This document is a revision of the public working draft dated 19980819 incorporating suggestions received in review comments and further deliberations of the W3C RDF Model and Syntax Working Group. With the publication of this draft, the RDF Model and Syntax Specification enters "last call.&q ..."
Abstract

Cited by 926 (6 self)
 Add to MetaCart
Draft for review by W3C members and other interested parties. Publication as a working draft does not imply endorsement by the W3C membership. The RDF Model and Syntax Working Group will not allow early implementation to constrain their ability to make changes to this specification prior to final
Trading Group Theory for Randomness
, 1985
"... In a previous paper [BS] we proved, using the elements of the Clwory of nilyotenf yroupu, that some of the /undamcnla1 computational problems in mat & proup, belong to NP. These problems were also ahown to belong to CONP, assuming an unproven hypofhedi.9 concerning finilc simple Q ’ oup,. The a ..."
Abstract

Cited by 353 (9 self)
 Add to MetaCart
,. The aim of this paper is t.o replace most of the (proven and unproven) group theory of IBS] by elementary combinatorial argumenls. The rev & we prove is that relative to a random oracle f3, tbc meutioned matrix group problems belong to (NPncoNP)L! Thr problems we consider arr membership in and order
Analyzing Developmental Trajectories: A Semiparametric, GroupBased Approach
 Psychological Methods
, 1999
"... A developmental trajectory describes the course of a behavior over age or time. A groupbased method for identifying distinctive groups of individual trajectories within the population and for profiling the characteristics of group members is demonstrated. Such clusters might include groups of & ..."
Abstract

Cited by 232 (14 self)
 Add to MetaCart
groups of trajectories, (b) the capability to estimate the proportion of the population following each such trajectory group, (c) the capability to relate group membership probability to individual characteristics and circumstances, and (d) the capability to use the group membership probabilities
PolynomialTime Membership Comparable Sets
, 1994
"... This paper studies a notion called polynomialtime membership comparable sets. For a function g, a set A is polynomialtime gmembership comparable if there is a polynomialtime computable function f such that for any x 1 ; \Delta \Delta \Delta ; xm with m g(maxfjx 1 j; \Delta \Delta \Delta ; jx m j ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
time membership comparable sets have polynomialsize circuits. 3. For any function f and for any constant c ? 0, if a set is p f(n)tt reducible to a Pselective set, then the set is polynomialtime (1 + c) log f(n)membership comparable. 4. For any C chosen from fPSPACE;UP;FewP;NP;C=P;PP;MOD 2 P; MOD 3 P
MULTIDIMENSIONAL RESIDUES AND IDEAL MEMBERSHIP
"... Abstract. Let I(f ) be a zerodimensional ideal in C[z 1 , . . . , zn] defined by a mapping f . We compute the logarithmic residue of a polynomial g with respect to f . We adapt an idea introduced by Aizenberg to reduce the computation to a special case by means of a limiting process. We then consi ..."
Abstract
 Add to MetaCart
Abstract. Let I(f ) be a zerodimensional ideal in C[z 1 , . . . , zn] defined by a mapping f . We compute the logarithmic residue of a polynomial g with respect to f . We adapt an idea introduced by Aizenberg to reduce the computation to a special case by means of a limiting process. We
Previous versions:
"... use and software licensing rules apply. This document presents the formal semantics of [XQuery 1.0: A Query Language for XML], an XML query language. This document replaces the [XML Query Algebra]. Status of this document This section describes the status of this document at the time of its publicat ..."
Abstract
 Add to MetaCart
, replaced or made obsolete by other documents at any time. It is inappropriate to use W3C Working Drafts as reference material or to cite them as other than "work in progress". This is work in progress and does not imply endorsement by the W3C membership. This document has been produced as part
Equational and membership constraints for infinite trees
 Proceedings of the RTA '93
, 1993
"... We present a new constraint system with equational and membership constraints over infinite trees. It provides for complete and correct satisfiability and entailment tests and is therefore suitable for the use in concurrent constraint programming systems which are based on cyclic data structures. Ou ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Introduction 3 2 Equational and Membership Constraints 5 3 Set Definitions 6 4 Normal Forms of C...
Editors:
, 1999
"... document use and software licensing rules apply. This working draft defines the mechanism for defining markup language modules that are compatible with the modularization framework used by XHTML. This includes a definition of the way in which an abstract module is specified, the way in which this ab ..."
Abstract
 Add to MetaCart
draft may be updated, replaced or rendered obsolete by other W3C documents at any time. It is inappropriate to use W3C Working Drafts as reference material or to cite them as other than "work in progress". This document is work in progress and does not imply endorsement by the W3C membership.
On the complexity of learning from counterexamples and membership queries
 In 31st Annual Symposium on Foundations of Computer Science
, 1990
"... We show that for any concept class C the number of equivalence and membership queries that are needed to learn C is bounded from below by R(VCdimension(C)). Furthermore we show that the required number of equivalence and membership queries is also bounded from below by R(LC ARB(C) / log(1 + LC ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We show that for any concept class C the number of equivalence and membership queries that are needed to learn C is bounded from below by R(VCdimension(C)). Furthermore we show that the required number of equivalence and membership queries is also bounded from below by R(LC ARB(C) / log(1 + LC
On The Complexity Of Testing Membership In The Core Of MinCost Spanning Tree Games
 INTERNATIONAL JOURNAL OF GAME THEORY
, 1994
"... Let N = f1, ..., ng be a finite set of players and KN the complete graph on the node set N [ f0g. Assume that the edges of KN have nonnegative weights and associate with each coalition S ` N of players as cost c(S) the weight of a minimal spanning tree on the node set S [ f0g. Using reduction to EXA ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
to EXACT COVER BY 3SETS, we exhibit the following problem to be NPcomplete. Given the vector x 2 ! N with x(N ) = c(N ), decide whether there exists a coalition S such that x(S) ? c(S).
Results 1  10
of
373