Results 1  10
of
1,453,710
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 199 (9 self)
 Add to MetaCart
is sufficient for deciding satisfiability. Further, using an extensive machinegenerated case analysis, we show that the ORDHorn subclass is a maximal tractable subclass of the full algebra (assuming<F NaN> P6=NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain
Estimating Attributes: Analysis and Extensions of RELIEF
, 1994
"... . In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes. Origi ..."
Abstract

Cited by 474 (25 self)
 Add to MetaCart
. In the context of machine learning from examples this paper deals with the problem of estimating the quality of attributes with and without dependencies among them. Kira and Rendell (1992a,b) developed an algorithm called RELIEF, which was shown to be very efficient in estimating attributes
Longitudinal data analysis using generalized linear models”.
 Biometrika,
, 1986
"... SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence. The estimating ..."
Abstract

Cited by 1526 (8 self)
 Add to MetaCart
SUMMARY This paper proposes an extension of generalized linear models to the analysis of longitudinal data. We introduce a class of estimating equations that give consistent estimates of the regression parameters and of their variance under mild assumptions about the time dependence
Reasoning about Temporal Relatio A Maximal Tractable Su of Alllen's Interval Algebra*
"... Abstract We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is ..."
Abstract
 Add to MetaCart
is sufficient for deciding satisfiability. Further, using an extensive machinegenerated case analysis, we show that the ORDHorn subclass is a maximal tractable subclass of the full algebra (assuming P#NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic
Boosting a Weak Learning Algorithm By Majority
, 1995
"... We present an algorithm for improving the accuracy of algorithms for learning binary concepts. The improvement is achieved by combining a large number of hypotheses, each of which is generated by training the given learning algorithm on a different set of examples. Our algorithm is based on ideas pr ..."
Abstract

Cited by 516 (16 self)
 Add to MetaCart
for parallelizing PAC learning algorithms. We provide extensions of our algorithms to cases in which the conc...
From Data Mining to Knowledge Discovery in Databases.
 AI Magazine,
, 1996
"... ■ Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in database ..."
Abstract

Cited by 538 (0 self)
 Add to MetaCart
in databases are related both to each other and to related fields, such as machine learning, statistics, and databases. The article mentions particular realworld applications, specific datamining techniques, challenges involved in realworld applications of knowledge discovery, and current and future
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 783 (29 self)
 Add to MetaCart
algorithm. The algorithm is a natural extension of the support vector algorithm to the case of unlabelled d...
lmbench: Portable Tools for Performance Analysis
 In USENIX Annual Technical Conference
, 1996
"... lmbench: Portable tools for performance analysis lmbench is a microbenchmark suite designed to focus attention on the basic building blocks of many common system applications, such as databases, simulations, software development, and networking. In almost all cases, the individual tests are the res ..."
Abstract

Cited by 464 (2 self)
 Add to MetaCart
lmbench: Portable tools for performance analysis lmbench is a microbenchmark suite designed to focus attention on the basic building blocks of many common system applications, such as databases, simulations, software development, and networking. In almost all cases, the individual tests
Human Responses to MachineGenerated Speech with Emotional Content
, 2013
"... The aim of the present thesis was to examine how people respond to synthetically produced lexical expressions of emotions. When speaking, both the content of spoken words and the prosodic cues, such as pitch and the speed of the speech, can mediate emotionrelated information. To study how the pure ..."
Abstract
 Add to MetaCart
content of spoken words affects human emotions, speech synthesizers offer good opportunities as they allow for good controllability over the prosodic cues. Synthetic speech can be generated using different techniques. Such speech can be purely machine generated or it can be based on different types (i
Measuring Popularity of MachineGenerated Sentences Using Term Count, Document Frequency, and Dependency Language Model
"... We investigated the notion of “popularity” for machinegenerated sentences. We defined a popular sentence as one that contains words that are frequently used, appear in many documents, and contain frequent dependencies. We measured the popularity of sentences based on three components: content morp ..."
Abstract
 Add to MetaCart
We investigated the notion of “popularity” for machinegenerated sentences. We defined a popular sentence as one that contains words that are frequently used, appear in many documents, and contain frequent dependencies. We measured the popularity of sentences based on three components: content
Results 1  10
of
1,453,710