Results 1  10
of
3,986,118
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 12992 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
A semantics of multiple inheritance
 Information and Computation
, 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract

Cited by 527 (9 self)
 Add to MetaCart
) and function spaces (i.e. functions and procedures).
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 561 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Semantic matching of web services capabilities
, 2002
"... Abstract. The Web is moving from being a collection of pages toward a collection of services that interoperate through the Internet. The first step toward this interoperation is the location of other services that can help toward the solution of a problem. In this paper we claim that location of web ..."
Abstract

Cited by 569 (24 self)
 Add to MetaCart
advertisements and service requests that recognizes when a request matches an advertisement. We adopt DAMLS as service description language because it provides a semantically based view of of web services which spans from the abstract description of the capabilities of
Unsupervised Learning by Probabilistic Latent Semantic Analysis
 Machine Learning
, 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of cooccurren ..."
Abstract

Cited by 609 (4 self)
 Add to MetaCart
Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of co
On understanding types, data abstraction, and polymorphism
 ACM COMPUTING SURVEYS
, 1985
"... Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Objectoriented languag ..."
Abstract

Cited by 843 (13 self)
 Add to MetaCart
by universal quantification to model generic functions with type parameters, existential quantification and packaging (information hiding) to model abstract data types, and
The ratedistortion function for source coding with side information at the decoder
 IEEE Trans. Inform. Theory
, 1976
"... AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a seque ..."
Abstract

Cited by 1048 (1 self)
 Add to MetaCart
AbstractLet {(X,, Y,J}r = 1 be a sequence of independent drawings of a pair of dependent random variables X, Y. Let us say that X takes values in the finite set 6. It is desired to encode the sequence {X,} in blocks of length n into a binary stream*of rate R, which can in turn be decoded as a
Algebraic laws for nondeterminism and concurrency
 Journal of the ACM
, 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract

Cited by 597 (13 self)
 Add to MetaCart
Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth
A model for technical inefficiency effects in a stochastic frontier production function for panel data
 Empirical Economics
, 1995
"... Abstract: A stochastic frontier production function is defined for panel data on firms, in which the nonnegative technical inetGciency effects are assumed to be a function of firmspecific variables and time. The inefficiency effects are assumed to be independently distributed as truncations of nor ..."
Abstract

Cited by 534 (4 self)
 Add to MetaCart
Abstract: A stochastic frontier production function is defined for panel data on firms, in which the nonnegative technical inetGciency effects are assumed to be a function of firmspecific variables and time. The inefficiency effects are assumed to be independently distributed as truncations
The Berkeley FrameNet Project
 IN PROCEEDINGS OF THE COLINGACL
, 1998
"... FrameNet is a threeyear NSFsupported project in corpusbased computational lexicography, now in its second year #NSF IRI9618838, #Tools for Lexicon Building"#. The project's key features are #a# a commitment to corpus evidence for semantic and syntactic generalizations, and #b# the repr ..."
Abstract

Cited by 628 (3 self)
 Add to MetaCart
#semantic and syntactic# of several thousand words and phrases, each accompanied by #c# a representative collection of annotated corpus attestations, which jointly exemplify the observed linkings between #frame elements" and their syntactic realizations #e.g. grammatical function, phrase type
Results 1  10
of
3,986,118