Results 11  20
of
4,199,526
Approximating maximum leaf spanning trees in almost linear time
 J. of Algorithms
, 1998
"... hilcsccuedutw ..."
Surface reconstruction in almost linear time under locally uniform sampling
, 2001
"... We describe an implementation of the COCONE algorithm for smooth surface reconstruction which runs in time if the sample is “locally uniform ” in addition to being good in the sense required for the Cocone algorithm. If the local uniformity condition does not hold, the algorithm still produces a cor ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
We describe an implementation of the COCONE algorithm for smooth surface reconstruction which runs in time if the sample is “locally uniform ” in addition to being good in the sense required for the Cocone algorithm. If the local uniformity condition does not hold, the algorithm still produces a
Surface Reconstruction in Almost Linear Time under Locally Uniform Sampling
, 2001
"... We describe an implementation of the COCONE algorithm for smooth surface reconstruction which runs in O(n log n) time if the sample is "locally uniform" in addition to being good in the sense required for the Cocone algorithm. If the local uniformity condition does not hold, the algorithm ..."
Abstract
 Add to MetaCart
We describe an implementation of the COCONE algorithm for smooth surface reconstruction which runs in O(n log n) time if the sample is "locally uniform" in addition to being good in the sense required for the Cocone algorithm. If the local uniformity condition does not hold, the algorithm
Review of “Greedy Decoding for statistical machine translation in almost linear time”
"... We will provide a overview of the paper by Germann, giving a description of the methods employed. The key claim is that significant speedup in translation is ..."
Abstract
 Add to MetaCart
We will provide a overview of the paper by Germann, giving a description of the methods employed. The key claim is that significant speedup in translation is
Greedy Decoding for Statistical Machine Translation in Almost Linear Time
"... We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic ( ¢¡¤£¦¥¨ § when applied naïvely) to practically linear time 1 without sacrificing translation quality. We achieve this by integrating hypothesis evaluatio ..."
Abstract
 Add to MetaCart
We present improvements to a greedy decoding algorithm for statistical machine translation that reduce its time complexity from at least cubic ( ¢¡¤£¦¥¨ § when applied naïvely) to practically linear time 1 without sacrificing translation quality. We achieve this by integrating hypothesis
An Almost Linear Time 2.8334Approximation Algorithm for the Disc Covering Problem ⋆
"... Abstract. The disc covering problem asks to cover a set of points on the plane with a minimum number of fixsized discs. We develop an O(n(log n) 2 (log log n) 2) deterministic time 2.8334approximation algorithm for this problem. Previous approximation algorithms [7, 3, 6], when used to achieve the ..."
Abstract
 Add to MetaCart
Abstract. The disc covering problem asks to cover a set of points on the plane with a minimum number of fixsized discs. We develop an O(n(log n) 2 (log log n) 2) deterministic time 2.8334approximation algorithm for this problem. Previous approximation algorithms [7, 3, 6], when used to achieve
An almost ideal demand system
 American Economic Review
, 1980
"... prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtai ..."
Abstract

Cited by 600 (0 self)
 Add to MetaCart
prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, noncommercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at
Computing shortest nontrivial cycles on orientable surfaces of bounded genus in almost linear time
 In SOCG ’06: Proc. 22nd Symp. Comput. Geom
, 2006
"... We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving upon ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
We present an algorithm that computes a shortest noncontractible and a shortest nonseparating cycle on an orientable combinatorial surface of bounded genus in O(n log n) time, where n denotes the complexity of the surface. This solves a central open problem in computational topology, improving
An almost linear time algorithm for a general haplotype solution on tree pedigrees with no recombination and its extensions
 Journal of Bioinformatics and Computational Biology
, 2009
"... We study the haplotype inference problem from pedigree data under the zero recombination assumption, which is well supported by real data for tightly linked markers (i.e. single nucleotide polymorphisms (SNPs)) over a relatively large chromosome segment. We solve the problem in a rigorous mathematic ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
data, our algorithm can output a general solution as well as the number of total specific solutions in a nearly linear time O(mn · α(n)), where m is the number of loci, n is the number of individuals and α is the inverse Ackermann function, which is a further improvement over existing ones. We also
An Almost Linear Time Approximation Algorithm for the Permanent of a Random (01) Matrix
"... We present a simple randomized algorithm for approximating permanents. The algorithm with inputs A, # > 0 produces an output XA with (1#)per(A) XA (1+#)per(A) for almost all (01) matrices A. For any positive constant # > 0, and almost all (01) matrices the algorithm runs in time O ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a simple randomized algorithm for approximating permanents. The algorithm with inputs A, # > 0 produces an output XA with (1#)per(A) XA (1+#)per(A) for almost all (01) matrices A. For any positive constant # > 0, and almost all (01) matrices the algorithm runs in time
Results 11  20
of
4,199,526