Results 1  10
of
910,126
NordhausGaddum bounds for independent domination
 Discrete Math
, 2003
"... We establish sharp bounds on the sum and product of the independent domination numbers of a graph and its complement. Key words: domination, independence, complement, Nordhaus–Gaddum The independent domination number i(G) of a graph G is the minimum cardinality of a set that is both independent and ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We establish sharp bounds on the sum and product of the independent domination numbers of a graph and its complement. Key words: domination, independence, complement, Nordhaus–Gaddum The independent domination number i(G) of a graph G is the minimum cardinality of a set that is both independent
INEQUALITIES OF NORDHAUS–GADDUM TYPE FOR CONNECTED DOMINATION
"... Abstract. A set S of vertices of a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γc(G) is the minimum size of a connected dominating set of G. In this paper we prove that γc(G ..."
Abstract
 Add to MetaCart
(G)} + 2 if γc(G), γc(G) ≥ 4 and show that the bound is sharp when min{δ(G), δ(G)} = 6. Keywords: connected dominating set, connected domination number, NordhausGaddum inequalities. MSC 2000: 05C69
NordhausGaddum Bounds for kDomination in Graphs
, 2007
"... A kdominating set of a graph G is a set S of vertices of G such that every vertex outside of S has k neighbors in S. The kdomination number of G, written γk(G), is the size of the smallest kdominating set in G. In this paper, we derive sharp upper and lower bounds on γk(G) + γk(G) and γk(G)γk(G), ..."
Abstract
 Add to MetaCart
A kdominating set of a graph G is a set S of vertices of G such that every vertex outside of S has k neighbors in S. The kdomination number of G, written γk(G), is the size of the smallest kdominating set in G. In this paper, we derive sharp upper and lower bounds on γk(G) + γk(G) and γk
LowPower CMOS Digital Design
 JOURNAL OF SOLIDSTATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413
, 1992
"... Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use the ..."
Abstract

Cited by 570 (20 self)
 Add to MetaCart
Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use
Powerlaw distributions in empirical data
 ISSN 00361445. doi: 10.1137/ 070710111. URL http://dx.doi.org/10.1137/070710111
, 2009
"... Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur in the t ..."
Abstract

Cited by 589 (7 self)
 Add to MetaCart
Powerlaw distributions occur in many situations of scientific interest and have significant consequences for our understanding of natural and manmade phenomena. Unfortunately, the empirical detection and characterization of power laws is made difficult by the large fluctuations that occur
Unified analysis of discontinuous Galerkin methods for elliptic problems
 SIAM J. Numer. Anal
, 2001
"... Abstract. We provide a framework for the analysis of a large class of discontinuous methods for secondorder elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical treatment ..."
Abstract

Cited by 519 (31 self)
 Add to MetaCart
Abstract. We provide a framework for the analysis of a large class of discontinuous methods for secondorder elliptic problems. It allows for the understanding and comparison of most of the discontinuous Galerkin methods that have been proposed over the past three decades for the numerical
Lag length selection and the construction of unit root tests with good size and power
 Econometrica
, 2001
"... It is widely known that when there are errors with a movingaverage root close to −1, a high order augmented autoregression is necessary for unit root tests to have good size, but that information criteria such as the AIC and the BIC tend to select a truncation lag (k) that is very small. We conside ..."
Abstract

Cited by 534 (14 self)
 Add to MetaCart
(1996). We also extend the M tests developed in Perron and Ng (1996) to allow for GLS detrending of the data. The MIC along with GLS detrended data yield a set of tests with desirable size and power properties.
RealTime Dynamic Voltage Scaling for LowPower Embedded Operating Systems
, 2001
"... In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery lif ..."
Abstract

Cited by 498 (4 self)
 Add to MetaCart
In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingly sophisticated and processing power increases, the most serious limitation on these devices is the available battery
A solution to Plato’s problem: The latent semantic analysis theory of acquisition, induction, and representation of knowledge
 PSYCHOLOGICAL REVIEW
, 1997
"... How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis (LS ..."
Abstract

Cited by 1772 (10 self)
 Add to MetaCart
How do people know as much as they do with as little information as they get? The problem takes many forms; learning vocabulary from text is an especially dramatic and convenient case for research. A new general theory of acquired similarity and knowledge representation, latent semantic analysis
Results 1  10
of
910,126