Results 1  10
of
7,343
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract

Cited by 1129 (32 self)
 Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Government spending in a simple model of endogenous growth
 The Journal of Political Economy
, 1990
"... (Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. ..."
Abstract

Cited by 1087 (1 self)
 Add to MetaCart
(Article begins on next page) The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
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
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 structural theories that attribute crosscountry differences in financial development to timeinvariant factors, such as a country's legal origin or culture. We propose an "interest group" theory of financial development where incumbents oppose financial development because it breeds 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 that different kinds of institutional heritages afford different scope for private interests to express themselves, we obtain a...
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 455 (100 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believed assumptions, DLP is strictly more expressive than normal (disjunctionfree) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing problems of lower complexity in a simpler and more natural fashion. This paper presents the DLV system, which is widely considered the stateoftheart implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, functionfree disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to ∆P 3complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of
Econometric methods for fractional response variables with an application to 401 (k) plan participation rates'. National Bureau of Economic Research Technical Working Paper No
, 1993
"... We develop attractive functional forms and simple quasilikelihood estimation methods for regression models with a fractional dependent variable. Compared with logodds type procedures, there is no difficulty in recovering the regression function for the fractional variable, and there is no need to ..."
Abstract

Cited by 441 (8 self)
 Add to MetaCart
We develop attractive functional forms and simple quasilikelihood estimation methods for regression models with a fractional dependent variable. Compared with logodds type procedures, there is no difficulty in recovering the regression function for the fractional variable, and there is no need to use ad hoc transformations to handle data at the extreme values of zero and one. We also offer some new, robust specification tests by nesting the logit or probit function in a more general functional form. We apply these methods to a data set of employee participation rates in 401 (k) pension plans. I.
StarAvoiding Ramsey Numbers
, 2009
"... The graph Ramsey number R(G, H) is the smallest integer n such that every 2coloring of the edges of Kn contains either a red copy of G or a blue copy of H. We find the largest star that can be removed from Kn such that the underlying graph is still forced to have a red G or a blue H. Thus, we intro ..."
Abstract
 Add to MetaCart
a 4cycle. In addition to finding the staravoiding Ramsey numbers, the critical graphs are classified for R(Tn, Km), R(nK2, mK2) and R(Pn, C4).
The Ramsey numbers of stars versus wheels
, 2004
"... For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Sn denote a star of order n and Wm a wheel of order m+1. This paper shows that R(Sn, W6) = 2n+1 for n ≥ 3 ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest positive integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Sn denote a star of order n and Wm a wheel of order m+1. This paper shows that R(Sn, W6) = 2n+1 for n
StarCritical Ramsey Numbers
, 2010
"... The graph Ramsey number R(G, H) is the smallest integer r such that every 2coloring of the edges of Kr contains either a red copy of G or a blue copy of H. We find the largest star that can be removed from Kr such that the underlying graph is still forced to have a red G or a blue H. Thus, we intro ..."
Abstract
 Add to MetaCart
introduce the starcritical Ramsey number r∗(G, H) as the smallest integer k such that every 2coloring of the edges of Kr −K1,r−1−k contains either a red copy of G or a blue copy of H. We find the starcritical Ramsey number for trees versus complete graphs, multiple copies of K2 and K3, and paths versus a
Results 1  10
of
7,343