Results 1  10
of
67,595
The Great Reversals: The Politics of Financial Development in the 20th Century
, 2001
"... Indicators of the development of the financial sector do not improve monotonically over time. In particular, we find that by most measures, countries were more financially developed in 1913 than in 1980 and only recently have they surpassed their 1913 levels. This pattern cannot be explained by stru ..."
Abstract

Cited by 527 (13 self)
 Add to MetaCart
competition. The theory predicts that incumbents' opposition will be weaker when an economy allows both crossborder trade and capital flows. This theory can go some way in accounting for the crosscountry differences and the time series variation of financial development. When we recognize
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
problems. We show that for some P problems either there is no phase transition or it occurs for bounded N (and so bound...
SeibergWitten prepotential from instanton counting
, 2002
"... In my lecture I consider integrals over moduli spaces of supersymmetric gauge field configurations (instantons, Higgs bundles, torsion free sheaves). The applications are twofold: physical and mathematical; they involve supersymmetric quantum mechanics of Dparticles in various dimensions, direct co ..."
Abstract

Cited by 496 (9 self)
 Add to MetaCart
computation of the celebrated SeibergWitten prepotential, sum rules for the solutions of the Bethe ansatz equations and their relation to the Laumon’s nilpotent cone. As a byproduct we derive some combinatoric identities involving the sums over Young tableaux.
Learning the Kernel Matrix with SemiDefinite Programming
, 2002
"... Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information ..."
Abstract

Cited by 780 (22 self)
 Add to MetaCart
Kernelbased learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the socalled kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input spaceclassical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied
SNOPT: An SQP Algorithm For LargeScale Constrained Optimization
, 2002
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 582 (23 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available, and that the constraint gradients are sparse. We discuss
Bundle Adjustment  A Modern Synthesis
 VISION ALGORITHMS: THEORY AND PRACTICE, LNCS
, 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract

Cited by 555 (12 self)
 Add to MetaCart
This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than restricting attention to traditional nonlinear least squares.
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs into the toolkit of every algorithm designer. The purpose of the seminar was to bring together leading experts from all over the world, and from the diverse areas of computer science that have been attracted to this new framework. The seminar was intended as the rst larger international meeting with a specic focus on parameterized complexity, and it hopefully serves as a driving force in the development of the eld. 1 We had 49 participants from Australia, Canada, India, Israel, New Zealand, USA, and various European countries. During the workshop 25 lectures were given. Moreover, one night session was devoted to open problems and Thursday was basically used for problem discussion
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) n 2 with 0 < α < 17 −3 (), and G has no book of size at least graph G1 of order at least
Investor Protection and Corporate Governance
, 1999
"... Recent research on corporate governance has documented large differences between countries in ownership concentration in publicly traded firms, in the breadth and depth of financial markets, and in the access of firms to external finance. We suggest that there is a common element to the explanations ..."
Abstract

Cited by 559 (11 self)
 Add to MetaCart
Recent research on corporate governance has documented large differences between countries in ownership concentration in publicly traded firms, in the breadth and depth of financial markets, and in the access of firms to external finance. We suggest that there is a common element to the explanations of these differences, namely how well investors, both shareholders and creditors, are protected by law from expropriation by the managers and controlling shareholders of firms. We describe the differences in laws and the effectiveness of their enforcement across countries, summarize the consequences of these differences, and suggest potential strategies of reform of corporate governance. We argue that the legal approach is a more fruitful way to understand corporate governance and its reform than the conventional distinction between bankcentered and marketcentered financial systems.
Results 1  10
of
67,595