Results 1 - 10 of 67,971

Multiple equilibrium problem and non-canonical correlation devices

by Indrajit Ray , 2002
"... Abstract: A correlated equilibrium for a normal form game is a mediator whose recommendations the players find optimal to follow obediently. A (direct) correlation device or a mediator however may face the multiple equilibrium problem as the obedient strategy profile may be dominated by some other N ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract: A correlated equilibrium for a normal form game is a mediator whose recommendations the players find optimal to follow obediently. A (direct) correlation device or a mediator however may face the multiple equilibrium problem as the obedient strategy profile may be dominated by some other

An Algorithm for Tracking Multiple Targets

by Donald B. Reid - IEEE Transactions on Automatic Control , 1979
"... Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m[~clngreports, and ..."
Abstract - Cited by 596 (0 self) - Add to MetaCart
Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m

The control of the false discovery rate in multiple testing under dependency

by Yoav Benjamini, Daniel Yekutieli - Annals of Statistics , 2001
"... Benjamini and Hochberg suggest that the false discovery rate may be the appropriate error rate to control in many applied multiple testing problems. A simple procedure was given there as an FDR controlling procedure for independent test statistics and was shown to be much more powerful than comparab ..."
Abstract - Cited by 1093 (16 self) - Add to MetaCart
Benjamini and Hochberg suggest that the false discovery rate may be the appropriate error rate to control in many applied multiple testing problems. A simple procedure was given there as an FDR controlling procedure for independent test statistics and was shown to be much more powerful than

Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions

by Alexander Strehl, Joydeep Ghosh, Claire Cardie - Journal of Machine Learning Research , 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract - Cited by 603 (20 self) - Add to MetaCart
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

by Amos Fiat, Adi Shamir , 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract - Cited by 1028 (1 self) - Add to MetaCart
is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control system.q.

The Equity Premium: A Puzzle

by Rajnish Mehra, Edward C. Prescott - Journal of Monetary Economics , 1985
"... Restrictions that a class of general equilibrium models place upon the average returns of equity and Treasury bills are found to be strongly violated by the U.S. data in the 1889-1978 period. This result is robust to model specification and measurement problems. We conclude that, most likely, an equ ..."
Abstract - Cited by 1751 (40 self) - Add to MetaCart
Restrictions that a class of general equilibrium models place upon the average returns of equity and Treasury bills are found to be strongly violated by the U.S. data in the 1889-1978 period. This result is robust to model specification and measurement problems. We conclude that, most likely

Worst-case equilibria

by Elias Koutsoupias, Christos Papadimitriou - IN PROCEEDINGS OF THE 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE , 1999
"... In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a ver ..."
Abstract - Cited by 847 (17 self) - Add to MetaCart
In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a

On the algorithmic implementation of multi-class kernel-based vector machines

by Koby Crammer, Yoram Singer, Nello Cristianini, John Shawe-taylor, Bob Williamson - Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernel-based vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract - Cited by 559 (13 self) - Add to MetaCart
objective function. Unlike most of previous approaches which typically decompose a multiclass problem into multiple independent binary classification tasks, our notion of margin yields a direct method for training multiclass predictors. By using the dual of the optimization problem we are able

Parallel Numerical Linear Algebra

by James W. Demmel, Michael T. Heath , Henk A. van der Vorst , 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract - Cited by 773 (23 self) - Add to MetaCart
illustrate these principles using current architectures and software systems, and by showing how one would implement matrix multiplication. Then, we present direct and iterative algorithms for solving linear systems of equations, linear least squares problems, the symmetric eigenvalue problem

A Maximum Entropy approach to Natural Language Processing

by Adam L. Berger, Stephen A. Della Pietra , Vincent J. Della Pietra - COMPUTATIONAL LINGUISTICS , 1996
"... The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we des ..."
Abstract - Cited by 1366 (5 self) - Add to MetaCart
The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we
Results 1 - 10 of 67,971