Results 1 - 10 of 43,269

Regularization Theory and Neural Networks Architectures

by Federico Girosi, Michael Jones, Tomaso Poggio - Neural Computation , 1995
"... We had previously shown that regularization principles lead to approximation schemes which are equivalent to networks with one layer of hidden units, called Regularization Networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known Radial Ba ..."
Abstract - Cited by 395 (32 self) - Add to MetaCart
to ridge approximation models, containing as special cases Breiman's hinge functions, som...

Using Daily Stock Returns: The Case of Event Studies

by Stephen J. Brown, Jerold B. Warner - Journal of Financial Economics , 1985
"... This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically well-specified even when special daily data characteris-tics ..."
Abstract - Cited by 805 (3 self) - Add to MetaCart
This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically well-specified even when special daily data characteris

Improved algorithms for optimal winner determination in combinatorial auctions and generalizations

by Tuomas Sandholm, Subhash Suri , 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract - Cited by 582 (53 self) - Add to MetaCart
presents a more sophisticated search algorithm for optimal (and anytime) winner determination, including structural improvements that reduce search tree size, faster data structures, and optimizations at search nodes based on driving toward, identifying and solving tractable special cases. We also uncover

The Semantics of Predicate Logic as a Programming Language

by M. H. Van Emden, R. A. Kowalski - JOURNAL OF THE ACM , 1976
"... Sentences in first-order predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract - Cited by 808 (18 self) - Add to MetaCart
semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.

Discriminative Training and Maximum Entropy Models for Statistical Machine Translation

by Franz Josef Och, Hermann Ney , 2002
"... We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source -channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language senten ..."
Abstract - Cited by 508 (30 self) - Add to MetaCart
We present a framework for statistical machine translation of natural languages based on direct maximum entropy models, which contains the widely used source -channel approach as a special case. All knowledge sources are treated as feature functions, which depend on the source language

The Byzantine Generals Problem,"

by L Lamport - ACM Transactions on Programming Languages and Systems, , 1982
"... Abstract The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an "incorrect" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case ..."
Abstract - Cited by 1561 (6 self) - Add to MetaCart
Abstract The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an "incorrect" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case

Transform Analysis and Asset Pricing for Affine Jump-Diffusions

by Darrell Duffie, Jun Pan, Kenneth Singleton - Econometrica , 2000
"... In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example applicat ..."
Abstract - Cited by 710 (38 self) - Add to MetaCart
In the setting of ‘‘affine’ ’ jump-diffusion state processes, this paper provides an analytical treatment of a class of transforms, including various Laplace and Fourier transforms as special cases, that allow an analytical treatment of a range of valuation and econometric problems. Example

Theory of the Firm: Managerial Behavior, Agency Costs and Ownership Structure

by Michael C. Jensen, William H. Meckling , 1976
"... This paper integrates elements from the theory of agency, the theory of property rights and the theory of finance to develop a theory of the ownership structure of the firm. We define the concept of agency costs, show its relationship to the ‘separation and control’ issue, investigate the nature of ..."
Abstract - Cited by 3043 (12 self) - Add to MetaCart
and equity claims is a special case of the supply side of the completeness of markets problem.

On combining classifiers

by Josef Kittler, Mohamad Hatef, Robert P. W. Duin, Jiri Matas - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1998
"... We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental ..."
Abstract - Cited by 1420 (33 self) - Add to MetaCart
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision

Option Pricing: A Simplified Approach

by John C. Cox, Stephen A. Ross, Mark Rubinstein - Journal of Financial Economics , 1979
"... This paper presents a simple discrete-time model for valumg optlons. The fundamental econonuc principles of option pricing by arbitrage methods are particularly clear In this setting. Its development requires only elementary mathematics, yet it contains as a special limiting case the celebrated Blac ..."
Abstract - Cited by 1016 (10 self) - Add to MetaCart
This paper presents a simple discrete-time model for valumg optlons. The fundamental econonuc principles of option pricing by arbitrage methods are particularly clear In this setting. Its development requires only elementary mathematics, yet it contains as a special limiting case the celebrated
Results 1 - 10 of 43,269