Results 1  10
of
585
Total Colouring With Delta+poly(log Delta) Colours
, 2000
"... We provide a polynomial time algorithm which nds a total colouring of any graph with maximum degree , suciently large, using at most + 8 log 8 colours. This improves the best previous upper bound on the total chromatic number of + 18 1=3 log(3). ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We provide a polynomial time algorithm which nds a total colouring of any graph with maximum degree , suciently large, using at most + 8 log 8 colours. This improves the best previous upper bound on the total chromatic number of + 18 1=3 log(3).
RCS  a system for version control
, 1991
"... An important problem in program development and maintenance is version control, i.e., the task of keeping a software system consisting of many versions and configurations well organized. The Revision Control System (RCS) is a software tool that assists with that task. RCS manages revisions of text d ..."
Abstract

Cited by 456 (7 self)
 Add to MetaCart
documents, in particular source programs, documentation, and test data. It automates the storing, retrieval, logging and identification of revisions, and it provides selection mechanisms for composing configurations. This paper introduces basic version control concepts and discusses the practice of version
\Delta \Delta \Delta
"... O(log m). If we denote by ff;fi;r;s m the Lebesgue constant of the extended interpolation process, then ff;fi;r;s m ¸ log m if ff 2 + 1 4 r ! ff 2 + 5 4 ; fi 2 + 1 4 s ! fi 2 + 5 4 : This technique has been extended to more general contexts and led to the construction of many class ..."
Abstract
 Add to MetaCart
O(log m). If we denote by ff;fi;r;s m the Lebesgue constant of the extended interpolation process, then ff;fi;r;s m ¸ log m if ff 2 + 1 4 r ! ff 2 + 5 4 ; fi 2 + 1 4 s ! fi 2 + 5 4 : This technique has been extended to more general contexts and led to the construction of many
Nearly optimal distributed edge colouring in O(log log n) rounds
 in Proceedings of the Eight Annual ACMSIAM Symposium on Discrete Algorithms (SODA 97
, 1996
"... An extremely simple distributed randomized algorithm is presented which with high probability properly edge colours a given graph using (1+ ")\Delta colours, where \Delta is the maximum degree of the graph and " is any given positive constant. The algorithm is very fast. In particular, for ..."
Abstract

Cited by 34 (6 self)
 Add to MetaCart
, for graphs with sufficiently large vertex degrees (larger than polylog n, but smaller than any positive power of n), the algorithm requires only O(log log n) communication rounds. The algorithm is inherently distributed, but can be implemented on the PRAM, where it requires O(m\Delta) processors and O(log
Delta log CFU from initial
"... P1059 Activity of antibiotic combinations towards intracellular small colony variants (SCVs) of S. aureus in a model of THP1 macrophages ..."
Abstract
 Add to MetaCart
P1059 Activity of antibiotic combinations towards intracellular small colony variants (SCVs) of S. aureus in a model of THP1 macrophages
A Parallel Hashed OctTree NBody Algorithm
, 1993
"... We report on an efficient adaptive Nbody method which we have recently designed and implemented. The algorithm computes the forces on an arbitrary distribution of bodies in a time which scales as N log N with the particle number. The accuracy of the force calculations is analytically bounded, and c ..."
Abstract

Cited by 199 (14 self)
 Add to MetaCart
We report on an efficient adaptive Nbody method which we have recently designed and implemented. The algorithm computes the forces on an arbitrary distribution of bodies in a time which scales as N log N with the particle number. The accuracy of the force calculations is analytically bounded
Online Interval Scheduling
 In Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms
, 1994
"... We introduce the online interval scheduling problem, in which a set of intervals of the positive real line is presented to a scheduling algorithm in order of start time. Upon seeing each interval, the algorithm must decide whether or not to "schedule " it. Overlapping intervals may not be ..."
Abstract

Cited by 89 (1 self)
 Add to MetaCart
give an algorithm with competitive factor O((log \Delta) 1+ffl ), and show that no O(log \Delta) competitive algorithm can exist. Our algorithm need not know the ratio \Delta in advance. 1 Introduction In the field of online scheduling, an algorithm must typically schedule a number of jobs, or tasks
Bell Numbers, LogConcavity, and LogConvexity
, 1999
"... . Let fb k (n)g 1 n=0 be the Bell numbers of order k. It is proved that the sequence fb k (n)=n!g 1 n=0 is logconcave and the sequence fb k (n)g 1 n=0 is logconvex, or equivalently, the following inequalities hold for all n 0, 1 b k (n + 2)b k (n) b k (n + 1) 2 n + 2 n + 1 : Let f ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
fff(n)g 1 n=0 be a sequence of positive numbers with ff(0) = 1. We show that if fff(n)g 1 n=0 is logconvex, then ff(n)ff(m) ff(n +m); 8n; m 0: On the other hand, if fff(n)=n!g 1 n=0 is logconcave, then ff(n +m) \Gamma n +m n \Delta ff(n)ff(m); 8n; m 0: In particular, we have
Coloring KColorable Graphs Using Smaller Palettes
 In Proc. 12th ACMSIAM Symposium on Discrete Algorithms
, 2001
"... We obtain the following new coloring results: ffl A 3colorable graph on n vertices with maximum degree \Delta can be colored, in polynomial time, using O((\Delta log \Delta) 1=3 \Delta log n) colors. This slightly improves an O((\Delta 1=3 log 1=2 \Delta) \Delta log n) bound given by Karger ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We obtain the following new coloring results: ffl A 3colorable graph on n vertices with maximum degree \Delta can be colored, in polynomial time, using O((\Delta log \Delta) 1=3 \Delta log n) colors. This slightly improves an O((\Delta 1=3 log 1=2 \Delta) \Delta log n) bound given
© Impact Journals WELL LOG CORRELATION OF THREE VERTICAL WELLS IN THE NIGER DELTA
"... This study presents correlation analysis of three wells in Xfield in the Niger Delta, using three well logs namely Spontaneous Potential (SP), gamma ray (GR) and deep induction log (ILD). Two basic steps were followed in the correlation analysis. These steps are sand and shale correlation in the bo ..."
Abstract
 Add to MetaCart
This study presents correlation analysis of three wells in Xfield in the Niger Delta, using three well logs namely Spontaneous Potential (SP), gamma ray (GR) and deep induction log (ILD). Two basic steps were followed in the correlation analysis. These steps are sand and shale correlation
Results 1  10
of
585