Results 1  10
of
1,931,787
Critical values for cointegration tests
 Eds.), LongRun Economic Relationship: Readings in Cointegration
, 1991
"... This paper provides tables of critical values for some popular tests of cointegration and unit roots. Although these tables are necessarily based on computer simulations, they are much more accurate than those previously available. The results of the simulation experiments are summarized by means of ..."
Abstract

Cited by 475 (3 self)
 Add to MetaCart
This paper provides tables of critical values for some popular tests of cointegration and unit roots. Although these tables are necessarily based on computer simulations, they are much more accurate than those previously available. The results of the simulation experiments are summarized by means
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 548 (19 self)
 Add to MetaCart
; packets, as is the case in ad hoc wireless networks, each node should transmit with just enough power to guarantee connectivity in the network. Towards this end, we derive the critical power a node in the network needs to transmit in order to ensure that the network is connected with probability one
Time Discounting and Time Preference: A Critical Review
 Journal of Economic Literature
, 2002
"... www.people.cornell.edu/pages/edo1/. ..."
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 then almost surely all components in such graphs are small. We can apply these results to G n;p ; G n;M , and other wellknown models of random graphs. There are also applications related to the chromatic number of sparse random graphs.
Auction Theory: A Guide to the Literature
 JOURNAL OF ECONOMIC SURVEYS
, 1999
"... This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthco ..."
Abstract

Cited by 528 (4 self)
 Add to MetaCart
This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub
Optimal Testing for Unit Roots
 in Panel Data, Mimeo
, 2002
"... COWLES FOUNDATION DISCUSSION PAPER NO. 998 ..."
Face Recognition: A Literature Survey
, 2000
"... ... This paper provides an uptodate critical survey of still and videobased face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an uptodate review of the existing literature, and the second is to offer some insights into ..."
Abstract

Cited by 1363 (21 self)
 Add to MetaCart
... This paper provides an uptodate critical survey of still and videobased face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an uptodate review of the existing literature, and the second is to offer some insights
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational and suitability to application. The paper attempts to expose some of the challenges and prospects for the further development of the field.
Supporting RealTime Applications in an Integrated Services Packet Network: Architecture and Mechanism
, 1992
"... This paper considers the support of realtime applications in an ..."
Abstract

Cited by 575 (25 self)
 Add to MetaCart
This paper considers the support of realtime applications in an
Disconnected Operation in the Coda File System
 ACM Transactions on Computer Systems
, 1992
"... Disconnected operation is a mode of operation that enables a client to continue accessing critical data during temporary failures of a shared data repository. An important, though not exclusive, application of disconnected operation is in supporting portable computers. In this paper, we show that di ..."
Abstract

Cited by 1014 (36 self)
 Add to MetaCart
Disconnected operation is a mode of operation that enables a client to continue accessing critical data during temporary failures of a shared data repository. An important, though not exclusive, application of disconnected operation is in supporting portable computers. In this paper, we show
Results 1  10
of
1,931,787