Results 1  10
of
1,813
Planning as satisfiability
 IN ECAI92
, 1992
"... We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraintbased planning systems ..."
Abstract

Cited by 505 (27 self)
 Add to MetaCart
We develop a formal model of planning based on satisfiability rather than deduction. The satis ability approach not only provides a more flexible framework for stating di erent kinds of constraints on plans, but also more accurately reflects the theory behind modern constraintbased planning
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
, 2001
"... Variable selection is fundamental to highdimensional statistical modeling, including nonparametric regression. Many approaches in use are stepwise selection procedures, which can be computationally expensive and ignore stochastic errors in the variable selection process. In this article, penalized ..."
Abstract

Cited by 948 (62 self)
 Add to MetaCart
likelihood approaches are proposed to handle these kinds of problems. The proposed methods select variables and estimate coefficients simultaneously. Hence they enable us to construct confidence intervals for estimated parameters. The proposed approaches are distinguished from others in that the penalty
Learning ReadOnce Formulas with Queries
 J. ACM
, 1989
"... A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time al ..."
Abstract

Cited by 115 (19 self)
 Add to MetaCart
A readonce formula is a boolean formula in which each variable occurs at most once. Such formulas are also called ¯formulas or boolean trees. This paper treats the problem of exactly identifying an unknown readonce formula using specific kinds of queries. The main results are a polynomial time
Word Sense Disambiguation Using Conceptual Density
 IN PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL LINGUISTICS
, 1996
"... This paper presents a method for the resolution of lexical ambiguity of nouns and its automatic evaluation over the Brown Corpus. The method relies on the use of the widecoverage noun taxonomy of WordNet and the notion of conceptual distance among concepts, captured by a Conceptual Density formula ..."
Abstract

Cited by 193 (15 self)
 Add to MetaCart
This paper presents a method for the resolution of lexical ambiguity of nouns and its automatic evaluation over the Brown Corpus. The method relies on the use of the widecoverage noun taxonomy of WordNet and the notion of conceptual distance among concepts, captured by a Conceptual Density formula
Learning Deep Architectures for AI
"... Theoretical results suggest that in order to learn the kind of complicated functions that can represent highlevel abstractions (e.g. in vision, language, and other AIlevel tasks), one may need deep architectures. Deep architectures are composed of multiple levels of nonlinear operations, such as i ..."
Abstract

Cited by 183 (30 self)
 Add to MetaCart
Theoretical results suggest that in order to learn the kind of complicated functions that can represent highlevel abstractions (e.g. in vision, language, and other AIlevel tasks), one may need deep architectures. Deep architectures are composed of multiple levels of nonlinear operations
Improvements to the evaluation of quantified Boolean formulae
 In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), July 31August 6
, 1999
"... We present a theoremprover for quantified Boolean formulae and evaluate it on random quantified formulae and formulae that represent problems from automated planning. Even though the notion of quantified Boolean formula is theoretically important, automated reasoning with QBF has not been thoroughl ..."
Abstract

Cited by 76 (3 self)
 Add to MetaCart
to evaluate quantified Boolean formulae. A straightforward algorithm of this kind is not very efficient. We identify universal quantifiers as the main area where improvements to the basic algorithm can be made. We present a number of techniques for reducing the amount of search that is needed, and evaluate
Centrality and Network Flow
"... Centrality measures, or at least our interpretations of these measures, make implicit assumptions about the manner in which things flow through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest p ..."
Abstract

Cited by 177 (4 self)
 Add to MetaCart
to the kinds of flows they are appropriate for. Simulations are used to examine the relationship between type of flow and the differential importance of nodes with respect to key measurements such as speed of reception of traffic and frequency of receiving traffic. It is shown that the offtheshelf formulas
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
reconstruction from multiple receiver data. Using the framework of linear algebra, two different reconstruction strategies have been derived. In their general forms the resulting formulae hold for arbitrary sampling patterns in kspace. A detailed discussion is dedicated to the most practical case, namely
An Explicit Formula for Bernoulli Numbers in Terms of Stirling Numbers of the Second Kind
, 2015
"... Abstract: In the paper, the authors recover an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind. Keywords: explicit formula; Bernoulli number; Stirling number of the second kind; Bell polynomial of the second kind ..."
Abstract
 Add to MetaCart
Abstract: In the paper, the authors recover an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind. Keywords: explicit formula; Bernoulli number; Stirling number of the second kind; Bell polynomial of the second kind
Results 1  10
of
1,813