Results 1  10
of
14,959
Argumentative Inference in Uncertain and Inconsistent Knowledge Bases
 In Proceedings of Uncertainty in Artificial Intelligence
, 1993
"... : This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A socalled argumentativeconsequence relation, taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is ..."
Abstract

Cited by 90 (3 self)
 Add to MetaCart
: This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A socalled argumentativeconsequence relation, taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary
Automating the Design of Graphical Presentations of Relational Information
 ACM Transactions on Graphics
, 1986
"... The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract

Cited by 559 (9 self)
 Add to MetaCart
The goal of the research described in this paper is to develop an applicationindependent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal
Learning the Kernel Matrix with SemiDefinite Programming
, 2002
"... Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information ..."
Abstract

Cited by 775 (21 self)
 Add to MetaCart
is contained in the socalled kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input spaceclassical model selection
The Askeyscheme of hypergeometric orthogonal polynomials and its qanalogue
, 1998
"... We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order differenti ..."
Abstract

Cited by 578 (6 self)
 Add to MetaCart
We list the socalled Askeyscheme of hypergeometric orthogonal polynomials and we give a qanalogue of this scheme containing basic hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation, the second order
Convex Analysis
, 1970
"... In this book we aim to present, in a unified framework, a broad spectrum of mathematical theory that has grown in connection with the study of problems of optimization, equilibrium, control, and stability of linear and nonlinear systems. The title Variational Analysis reflects this breadth. For a lo ..."
Abstract

Cited by 5411 (68 self)
 Add to MetaCart
progressed also to the study of socalled stationary points, critical points, and other indications of singularity that a point might have relative to its neighbors, especially in association with existence theorems for differential equations.
Social capital, intellectual capital, and the organizational advantage
 Academy of Management Review
, 1998
"... Scholars of the theory of the firm have begun to emphasize the sources and conditions of what has been described a s "the organizational advantage, " rather than focus on the causes and consequences of market failure. Typically, researchers see such organizational advantage a s accruing fr ..."
Abstract

Cited by 1215 (2 self)
 Add to MetaCart
Scholars of the theory of the firm have begun to emphasize the sources and conditions of what has been described a s "the organizational advantage, " rather than focus on the causes and consequences of market failure. Typically, researchers see such organizational advantage a s accruing
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
and scaling of gossip algorithms on two popular networks: Wireless Sensor Networks, which are modeled as Geometric Random Graphs, and the Internet graph under the socalled Preferential Connectivity (PC) model.
The Concept of a Linguistic Variable and its Application to Approximate Reasoning
 Journal of Information Science
, 1975
"... By a linguistic variable we mean a variable whose values are words or sentences in a natural or artificial language. I:or example, Age is a linguistic variable if its values are linguistic rather than numerical, i.e., young, not young, very young, quite young, old, not very oldand not very young, et ..."
Abstract

Cited by 1430 (9 self)
 Add to MetaCart
its compatibility with X. Thus, the COItIpdtibiiity of age 27 with young might be 0.7, while that of 35 might be 0.2. The function of the semantic rule is to relate the compdtibihties of the socalled primary terms in a composite linguistic valuee.g.,.young and old in not very young and not very old
Featherweight Java: A Minimal Core Calculus for Java and GJ
 ACM Transactions on Programming Languages and Systems
, 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract

Cited by 659 (23 self)
 Add to MetaCart
Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features
Dynamic programming algorithm optimization for spoken word recognition
 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract

Cited by 788 (3 self)
 Add to MetaCart
, are derived from the principle. These two forms are compared with each other through theoretical discussions and experimental studies. The symmetric form algorithm superiority is established. A new technique, called slope constraint, is successfully introduced, in which the warping function slope
Results 1  10
of
14,959