Results 1  10
of
997,745
THE CORRECTED LOG NLOG FLUENCE DISTRIBUTION OF COSMOLOGICAL γRAY BURSTS
, 1996
"... Recent analysis of relativistically expanding shells of cosmological γray bursts standard and not peak luminosity (L0). Assuming a flat Friedmann cosmology (qo = 1/2, Λ = 0) and constant rate density (ρ0) of bursting sources, we fit a standard candle energy to a uniformly selected log Nlog S in th ..."
Abstract
 Add to MetaCart
Recent analysis of relativistically expanding shells of cosmological γray bursts standard and not peak luminosity (L0). Assuming a flat Friedmann cosmology (qo = 1/2, Λ = 0) and constant rate density (ρ0) of bursting sources, we fit a standard candle energy to a uniformly selected log Nlog
RUSPACE(log n) \subseteq DSPACE(log² n/log log n)
 THE 7TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC’96
, 1998
"... We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine. ..."
Abstract
 Add to MetaCart
We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine.
AN n log log n/log n UPPER BOUND FOR THE COP NUMBER OF A GRAPH
, 2008
"... The Cops and Robber game is a twoplayer game with complete information played on undirected graphs. k cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. For a fixed graph, the infimum ove ..."
Abstract
 Add to MetaCart
The Cops and Robber game is a twoplayer game with complete information played on undirected graphs. k cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex. For a fixed graph, the infimum over all numbers k such that the cops player has a winning strategy is called the cop number of the graph. By c(n) we denote the highest cop number of a connected nvertex graph. A conjecture attributed to H. Meyniel [see Frankl, 1987] states that c(n) ∈ O ( √ n), which would be best possible. The best upper bound known was given by Frankl in 1987: c(n) ∈ o(n), or, more precisely c(n) ≤ n/p + p p for all n, p ≥ 1. In this mini note we show how a refinement of Frankl’s arguments yields c(n) ∈ O ( n lnln n/ln n).
The Design and Implementation of a LogStructured File System
 ACM Transactions on Computer Systems
, 1992
"... This paper presents a new technique for disk storage management called a logstructured file system. A logstructured file system writes all modifications to disk sequentially in a loglike structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk; it ..."
Abstract

Cited by 1092 (8 self)
 Add to MetaCart
This paper presents a new technique for disk storage management called a logstructured file system. A logstructured file system writes all modifications to disk sequentially in a loglike structure, thereby speeding up both file writing and crash recovery. The log is the only structure on disk
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 560 (15 self)
 Add to MetaCart
development of techniques that yield performance across a range of current and future parallel machines. This paper offers a new parallel machine model, called LogP, that reflects the critical technology trends underlying parallel computers. It is intended to serve as a basis for developing fast, portable
ReVirt: Enabling Intrusion Analysis through VirtualMachine Logging and Replay
 In Proceedings of the 2002 Symposium on Operating Systems Design and Implementation (OSDI
, 2002
"... Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. Current ..."
Abstract

Cited by 469 (26 self)
 Add to MetaCart
system loggers have two problems: they depend on the integrity of the operating system being logged, and they do not save sufficient information to replay and analyze attacks that include any nondeterministic events. ReVirt removes the dependency on the target operating system by moving it into a
A Survey of RollbackRecovery Protocols in MessagePassing Systems
, 1996
"... this paper, we use the terms event logging and message logging interchangeably ..."
Abstract

Cited by 716 (22 self)
 Add to MetaCart
this paper, we use the terms event logging and message logging interchangeably
The log of Gravity
 THE REVIEW OF ECONOMICS AND STATISTICS
, 2005
"... Although economists have long been aware of Jensen's inequality, many econometric applications have neglected an important implication of it: the standard practice of interpreting the parameters of loglinearized models estimated by ordinary least squares as elasticities can be highly misleadin ..."
Abstract

Cited by 333 (6 self)
 Add to MetaCart
Although economists have long been aware of Jensen's inequality, many econometric applications have neglected an important implication of it: the standard practice of interpreting the parameters of loglinearized models estimated by ordinary least squares as elasticities can be highly
Stable signal recovery from incomplete and inaccurate measurements,”
 Comm. Pure Appl. Math.,
, 2006
"... Abstract Suppose we wish to recover a vector x 0 ∈ R m (e.g., a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is an n × m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To r ..."
Abstract

Cited by 1397 (38 self)
 Add to MetaCart
for almost any set of n coefficients provided that the number of nonzeros is of the order of n/(log m) 6 . In the case where the error term vanishes, the recovery is of course exact, and this work actually provides novel insights into the exact recovery phenomenon discussed in earlier papers. The methodology
Tractable reasoning and efficient query answering in description logics: The DLLite family
 J. OF AUTOMATED REASONING
, 2007
"... We propose a new family of Description Logics (DLs), called DLLite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computing subsumption between concepts, and checking satisfiability of the whole knowledge base, b ..."
Abstract

Cited by 497 (123 self)
 Add to MetaCart
, but also answering complex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. We show that, for the DLs of the DLLite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in the size
Results 1  10
of
997,745