Results 1  10
of
378,227
Nontrivial
"... linear bounds for a random walk driven by a simple symmetric exclusion process R.S. dos Santos 1 ..."
Abstract
 Add to MetaCart
linear bounds for a random walk driven by a simple symmetric exclusion process R.S. dos Santos 1
Wrappers for Feature Subset Selection
 AIJ SPECIAL ISSUE ON RELEVANCE
, 1997
"... In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set, a ..."
Abstract

Cited by 1522 (3 self)
 Add to MetaCart
In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set
The Effective Potential of NonTrivial
"... Massless O(N)symmetric OE 4 theory, which has a nontrivial scaling limit for a negative quartic coupling constant, is investigated in leading order of a 1=Nexpansion, where a negative bare coupling naturally arises due to the nonperturbative renormalisation. The influence of an external sourc ..."
Abstract
 Add to MetaCart
Massless O(N)symmetric OE 4 theory, which has a nontrivial scaling limit for a negative quartic coupling constant, is investigated in leading order of a 1=Nexpansion, where a negative bare coupling naturally arises due to the nonperturbative renormalisation. The influence of an external
Nontrivial tintersection . . .
"... The function lattice, or generalized Boolean algebra, is the set of ℓtuples with the ith coordinate an integer between 0 and a bound ni. Two ℓtuples tintersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of tintersecting ℓtuples. ..."
Abstract
 Add to MetaCart
The function lattice, or generalized Boolean algebra, is the set of ℓtuples with the ith coordinate an integer between 0 and a bound ni. Two ℓtuples tintersect if they have at least t common nonzero coordinates. We prove a Hilton–Milner type theorem for systems of tintersecting ℓtuples.
Monetary Policy Shocks: What Have we Learned and to What End?
, 1998
"... This paper reviews recent research that grapples with the question: What happens after an exogenous shock to monetary policy? We argue that this question is interesting because it lies at the center of a particular approach to assessing the empirical plausibility of structural economic models that c ..."
Abstract

Cited by 967 (25 self)
 Add to MetaCart
effects of a monetary policy shock in the sense that inference is robust across a large subset of the identification schemes that have been considered in the literature. We document the nature of this agreement as
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
that come from objectoriented programming have direct representation in Flogic; other, secondary aspects of this paradigm are easily modeled as well. The paper also discusses semantic issues pertaining to programming with a deductive objectoriented language based on a subset of Flogic.
Decentralized Trust Management
 In Proceedings of the 1996 IEEE Symposium on Security and Privacy
, 1996
"... We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and security credentials, determining whether particular sets of credentials satisfy the relevant policies, an ..."
Abstract

Cited by 1011 (25 self)
 Add to MetaCart
, and deferring trust to third parties. Existing systems that support security in networked applications, including X.509 and PGP, address only narrow subsets of the overall trust management problem and often do so in a manner that is appropriate to only one application. This paper presents a comprehensive
Results 1  10
of
378,227