Results 1  10
of
46,265
A Parameterized Route to Exact Puzzles: Breaking the 2^ nBarrier for Irredundance (Extended Abstract)
"... The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G) respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a longstanding open question whether determining these numbers for a graph G ..."
Abstract
 Add to MetaCart
G on n vertices admits exact algorithms running in time less than the trivial Ω(2 n) enumeration barrier. We solve this open problem by devising parameterized algorithms for the duals of the natural parameterizations of the problems with running times faster than O ∗ (4 k). For example, we present
A Parameterized Route to Exact Puzzles: Breaking the 2^nBarrier for irredundance (Extended Abstract)
"... The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G) respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a longstanding open question whether determining these numbers for a graph G ..."
Abstract
 Add to MetaCart
on n vertices admits exact algorithms running in time less than the trivial Ω(2 n) enumeration barrier. We solve these open problems by devising parameterized algorithms for the dual of the natural parameterizations of the problems with running times faster than O ∗ (4 k). For example, we present
BREAKING THE 2^nBARRIER FOR IRREDUNDANCE: A PARAMETERIZED ROUTE TO SOLVING EXACT PUZZLES (Extended Abstract)
, 2009
"... The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G) respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a longstanding open question whether determining these numbers for a graph G ..."
Abstract
 Add to MetaCart
on n vertices admits exact algorithms running in time less than the trivial Ω(2 n) enumeration barrier. We solve these open problems by devising parameterized algorithms for the dual of the natural parameterizations of the problems with running times faster than O ∗ (4 k). For example, we present
Breaking the 2^nBarrier for Irredundance: Two Lines of Attack
, 2011
"... The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to the domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graph G on ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
on n vertices admits exact algorithms running in time faster than the trivial Θ(2n · poly(n)) enumeration, also called the 2nbarrier. The main contributions of this article are exact exponentialtime algorithms breaking the 2 nbarrier for irredundance. We establish algorithms with running times of O
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
Gravity with Gravitas: a Solution to the Border Puzzle
, 2001
"... Gravity equations have been widely used to infer trade ow effects of various institutional arrangements. We show that estimated gravity equations do not have a theoretical foundation. This implies both that estimation suffers from omitted variables bias and that comparative statics analysis is unfo ..."
Abstract

Cited by 610 (3 self)
 Add to MetaCart
is unfounded. We develop a method that (i) consistently and ef ciently estimates a theoretical gravity equation and (ii) correctly calculates the comparative statics of trade frictions. We apply the method to solve the famous McCallum border puzzle. Applying our method, we nd that national borders reduce
An intrusiondetection model
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1987
"... A model of a realtime intrusiondetection expert system capable of detecting breakins, penetrations, and other forms of computer abuse is described. The model is based on the hypothesis that security violations can be detected by monitoring a system's audit records for abnormal patterns of sy ..."
Abstract

Cited by 632 (0 self)
 Add to MetaCart
A model of a realtime intrusiondetection expert system capable of detecting breakins, penetrations, and other forms of computer abuse is described. The model is based on the hypothesis that security violations can be detected by monitoring a system's audit records for abnormal patterns
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 724 (33 self)
 Add to MetaCart
and Ftheory compactifications on CalabiYau fourfolds. In each case, the hierarchy of scales is fixed by a choice of RR and NS fluxes in the compact manifold. Our solutions involve compactifications of the KlebanovStrassler gravity dual to a confining N = 1 supersymmetric gauge theory
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 518 (5 self)
 Add to MetaCart
for the consideration of other agents and the environment in which it exists. Moreover, a formalisation of trust enables the embedding of the concept into an artificial agent. This has been done, and is documented in the thesis. 2. Exposition There are places in the thesis where it is necessary to give a broad outline
Results 1  10
of
46,265