Results 1  10
of
272
Straightline drawings of outerplanar graphs in O(dn log n) area
 CANADIAN CONFERENCE ON COMPUTATIONAL GEOMETRY (CCCG ’07
, 2007
"... We show an algorithm for constructing O(dn log n) area outerplanar straightline drawings of nvertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We show an algorithm for constructing O(dn log n) area outerplanar straightline drawings of nvertex outerplanar graphs with degree d. Also, we settle in the negative a conjecture [1] on the area requirement of outerplanar graphs by showing that snowflake graphs admit linear area drawings.
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract

Cited by 984 (32 self)
 Add to MetaCart
positive real ffl, a data point p is a (1 + ffl)approximate nearest neighbor of q if its distance from q is within a factor of (1 + ffl) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in R d in O(dn log n) time and O(dn) space, so that given a
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
matching), improved from O(nm log0dn+2)n); (4) O(mj3(m, n)) for the minimum spanning tree problem, improved from O(mloglo&,,.+2,n), where j3(m, n) = min {i 1 log % 5 m/n). Note that B(m, n) 5 log*n if m 2 n. Of these results, the improved bound for minimum spanning trees is the most striking, although
A strong law for the largest nearest neighbor link on normally distributed
 Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graphs, Submitted
, 2006
"... Let n points be placed independently in d−dimensional space according to the standard d−dimensional normal distribution. Let dn be the longest edge length for the nearest neighbor graph on these points. We show that lim n→∞ log n dn log log n = d √ 2 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Let n points be placed independently in d−dimensional space according to the standard d−dimensional normal distribution. Let dn be the longest edge length for the nearest neighbor graph on these points. We show that lim n→∞ log n dn log log n = d √ 2
, D.N. Gandhi
"... The present investigation represents the effect of freeze drying on some properties as acid and bile tolerance of Streptococcus thermophilus MTCC 1938 culture isolated from dairy products. The cell paste obtained from milk based medium was freeze dried with a pressure of 50100 mtorr for 24h at40 o ..."
Abstract
 Add to MetaCart
o C. Acid and bile tolerance test exhibited 3.84.9 and 3.23.8 log counts reduction after freeze drying respectively.
A Fast Algorithm for Confidently Stable Matching (Version 1.0)
, 2002
"... An efficient O(d n) algorithm for confidently stable matching for general inhibition zones and an O(dn log n) algorithm for Xzones are proposed and proved, where n is matching table size and d is inhibition zone depth. ..."
Abstract
 Add to MetaCart
An efficient O(d n) algorithm for confidently stable matching for general inhibition zones and an O(dn log n) algorithm for Xzones are proposed and proved, where n is matching table size and d is inhibition zone depth.
ðn 2 = log nÞ SpeedUp of TBR Heuristics for the GeneDuplication Problem
"... Abstract—The geneduplication problem is to infer a species supertree from gene trees that are confounded by complex histories of gene duplications. This problem is NPcomplete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, wher ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
, where each step is guided by an exact solution to an instance of a local search problem. We improve on the time complexity of the local search problem by a factor of n 2 = log n, where n is the size of the resulting species supertree. Typically, several thousand instances of the local search problem
Bounds for the size of sets with the property D(n
 III
, 2004
"... Let n be a nonzero integer and a1 < a2 < · · · < am positive integers such that aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. It is known that m ≤ 5 for n = 1. In this paper we prove that m ≤ 31 for n  ≤ 400 and m < 15.476 log n  for n > 400. ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
Let n be a nonzero integer and a1 < a2 < · · · < am positive integers such that aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. It is known that m ≤ 5 for n = 1. In this paper we prove that m ≤ 31 for n  ≤ 400 and m < 15.476 log n  for n > 400.
An D(n log n) Lower Bound for a Restricted Form of Online Labeling Algorithm
"... Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound O(nlogn). This is proved by a mechanism dividing the label intervals into a list of collections whose corresponding costs are bounded from below by a suitably chosen function. 1. ..."
Abstract
 Add to MetaCart
Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound O(nlogn). This is proved by a mechanism dividing the label intervals into a list of collections whose corresponding costs are bounded from below by a suitably chosen function. 1.
Criticality of the Exponential Rate of Decay for the Largest Nearest Neighbor Link in Random Geometric Graphs
, 2009
"... Let n points be placed independently in d−dimensional space according to the density f(x) = Ade−λ‖x‖α, λ> 0, x ∈ ℜd, d ≥ 2. Let dn be the longest edge length of the nearest neighbor graph on these points. We show that (λ−1 log n) 1−1/αdn −bn converges weakly to the Gumbel distribution where bn ∼ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let n points be placed independently in d−dimensional space according to the density f(x) = Ade−λ‖x‖α, λ> 0, x ∈ ℜd, d ≥ 2. Let dn be the longest edge length of the nearest neighbor graph on these points. We show that (λ−1 log n) 1−1/αdn −bn converges weakly to the Gumbel distribution where bn
Results 1  10
of
272