Filters








1,071 Hits in 7.6 sec

RRB vector: a practical general purpose immutable sequence

Nicolas Stucki, Tiark Rompf, Vlad Ureche, Phil Bagwell
2015 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015  
in the literature and in use today.  ...  In our benchmarks, the RRB-Vector speedup for parallel operations is lower bounded by 7× when executing on 4 CPUs of 8 cores each.  ...  Acknowledgements We would like to thank the ICFP reviewers for their feedback and suggestions, which allowed us to improve the paper both in terms of clarity and in terms of breadth.  ... 
doi:10.1145/2784731.2784739 dblp:conf/icfp/StuckiRUB15 fatcat:2rh3zhqsgrasrnofdd2xuqy6be

RRB vector: a practical general purpose immutable sequence

Nicolas Stucki, Tiark Rompf, Vlad Ureche, Phil Bagwell
2015 SIGPLAN notices  
in the literature and in use today.  ...  In our benchmarks, the RRB-Vector speedup for parallel operations is lower bounded by 7× when executing on 4 CPUs of 8 cores each.  ...  Acknowledgements We would like to thank the ICFP reviewers for their feedback and suggestions, which allowed us to improve the paper both in terms of clarity and in terms of breadth.  ... 
doi:10.1145/2858949.2784739 fatcat:vrjvmrpz4vfezjcqmkk3a4opje

Efficient Parallel Algorithms for String Editing and Related Problems

Alberto Apostolico, Mikhail J. Atallah, Lawrence L. Larmore, Scott McFaddin
1990 SIAM journal on computing (Print)  
Efficient PRAM parallel algorithms Cor the string editing problem are given. If m = min(lxj, Iyl) and n = max(lxl,lyl), then the CREW bound is O(logmlogn} time with G(mn/lagm) processors.  ...  The CReW bound is O(logn(loglogm)2) time with O(mn(loglogm) processors. In all algorithms, space is O(mn).  ...  The authors are grateful to the referees and to Danny Chen for their careful reading and useful comments, and to Alok Aggarwal for pointing out an error in an earlier analysis of §7.  ... 
doi:10.1137/0219066 fatcat:y3ijopuhvbdhpboatckwr3y7ui

Finding biconnected componemts and computing tree functions in logarithmic parallel time

R.E. Tarjan, U. Vishkin
1984 25th Annual Symposium onFoundations of Computer Science, 1984.  
A serial implementation runs in O(n+m) time and space on a graph of n vertices and m edges. 4 parallel implementation runs in O(log n) time and O(n+m) space using O(n+m) processors on a concurrent-read  ...  An alternative implementation runs in Obn2/p3 time and O(n2) space using any number p C n /log n of processors, on a concurrent-read, exclusive-write parallel RAM.  ...  O(n+m) space, and O(n4m) processors, where n = (VI and m = ( E l . .  ... 
doi:10.1109/sfcs.1984.715896 dblp:conf/focs/TarjanV84 fatcat:37lbayfgjbgjrjpdiqgpiexbwy

Algorithm Engineering for Cut Problems [article]

Alexander Noe
2021 arXiv   pre-print
This work develops highly-efficient algorithms for the (global) minimum cut problem, the balanced graph partitioning problem and the multiterminal cut problem.  ...  All of these algorithms are efficient in practice and freely available for use.  ...  This allows us to perform the depth-first search and find the most balanced minimum cut in CG in time O(n∗ + m∗ ).  ... 
arXiv:2108.04566v1 fatcat:4tpyybkhsvg6toiuxkvdvychqu

Gene Expression Analysis for Type-2 Diabetes Mellitus–A Case Study on Healthy vs Diabetes with Parental History

Chandra Sekhar Vasamsetty, Srinivasa Rao Peri, Allam Appa Rao, K. Srinivas, Chinta Someswararao
2011 International Journal of Engineering and Technology  
This method focuses on identifying multivariate and univariate outliers using Mahalanobis Distance, Minimum Co-variance Determinant (MCD) and other statistical methods.  ...  Both environmental and genetic factors have roles in the development of any disease. The quest for an understanding of how genetic factors contribute to human disease is gathering speed.  ...  We denote: S out = {(log 2 (X i1 ), log 2 (X i2 )) / MD i > c for i=1,2,3...n} and S in = {(log 2 (X i1 ), log 2 (X i2 )) / MD i < c for i=1,2,3...n} where 'c' is the cut-off for a given quantile and n  ... 
doi:10.7763/ijet.2011.v3.243 fatcat:2t3ho5agwjcx7ccokgorjkmwdy

Efficient binary space partitions for hidden-surface removal and solid modeling

Michael S. Paterson, F. Frances Yao
1990 Discrete & Computational Geometry  
For the twodimensional case, we construct BSPs of size O(n log n) for n edges, while in three dimensions, we obtain BSPs of size O(n 2) for n planar facets and prove a matching lower bound of f~(n2).  ...  The second application is in solid modeling: given a polyhedron described by its n faces, we show how to generate an O(n2)-sized CSG (constructivesolid-#eometry) formula whose literals correspond to half-spaces  ...  Acknowledgments We thank Marshall Bern, Dan Greene, Ketan Mulmuley, and Bruce Naylor for helpful discussions on binary partitions.  ... 
doi:10.1007/bf02187806 fatcat:lv6gjvjmxnaxvf7xayvicgcrri

Binary partitions with applications to hidden surface removal and solid modelling

M. S. Paterson, F. F. Yao
1989 Proceedings of the fifth annual symposium on Computational geometry - SCG '89  
We construct binary. partitions of size 0(n log n) for n edges in the plane, and of size 0(n) if the edges are orthogonal.  ...  In three dimensions, we obtain binary partitions of size 0(n2) for n planar facets, and prove a lower bound of Q(nT). Two applications of efficient binary partitions are given.  ...  Acknowledgement We thank Jack Snoeyink for bringing to our attention the application to constructive solid geometry, and also Marshall Bern and Dan Greene for helpful discussions.  ... 
doi:10.1145/73833.73836 dblp:conf/compgeom/PatersonY89 fatcat:ledd6y444reopmnjyd5clxt7ga

Inference of Single-Cell Phylogenies from Lineage Tracing Data [article]

Matthew G Jones, Alex Khodaverdian, Jeffrey J Quinn, Michelle M Chan, Jeffrey A Hussmann, Robert Wang, Chenling Xu, Jonathan S Weissman, Nir Yosef
2019 bioRxiv   pre-print
The pairing of CRISPR/Cas9-based gene editing with massively parallel single-cell readouts now enables large-scale lineage tracing.  ...  However, the rapid growth in complexity of data from these assays has outpaced our ability to accurately infer phylogenetic relationships. To address this, we provide three resources.  ...  Acknowledgments The authors would like to thank the members of the Yosef and Weissman labs for their helpful discussions in the development of this project.  ... 
doi:10.1101/800078 fatcat:7hjtrcn5wvh6zmuca455spmxle

An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph

Elias Dahlhaus, Marek Karpinski
1994 Theoretical Computer Science  
The algorithm works in O(log'n) parallel time and O(nm) processors on CREW PRAM, for an n-vertex, m-edge graph, and is optimal up to a polylogarithmic factor with respect to the best sequential algorithm  ...  Dahlhaus, E. and M. Karpinski, An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph, Theoretical Computer Science 134 (1994) 493-528.  ...  Acknowledgements Bob Tarjan has raised to us the question of an efficient parallel algorithm for the ME0 Problem. We are thankful to him, and also to Philip Klein for the stimulating discussions.  ... 
doi:10.1016/0304-3975(94)90250-x fatcat:u5whyapbyvdepc4xzo4iszbdxm

Comparisons of mixing in chaotic and turbulent flows

K.B. Southerland, R.D. Frederiksen, W.J.A. Dahm, D.R. Dowling
1994 Chaos, Solitons & Fractals  
scaling for multiplicative processes is found only in regions having undergone extensive stretching and folding.  ...  of fully developed turbulent flows, The low Reynolds number, two-dimensional, time-periodic, closed flow between eccentric rotating cylinders is taken as the archetypal chaotic flow.  ...  [13] suggest that, for relatively low values of g2 and #, full self-similarity in the distribution of stretching values may not be achieved until n ~ 10.  ... 
doi:10.1016/0960-0779(94)90138-4 fatcat:hyu7l5efe5a4znlyaggapbjhaa

Machine learning sequence prioritization for cell type-specific enhancer design

Alyssa J Lawler, Easwaran Ramamurthy, Ashley R Brown, Naomi Shin, Yeonju Kim, Noelle Toong, Irene M Kaplow, Morgan Wirthlin, Xiaoyu Zhang, BaDoi N Phan, Grant A Fox, Kirsten Wade (+6 others)
2022 eLife  
SNAIL works by leveraging machine learning and other computational approaches to identify DNA sequence features that confer cell type-specific gene activation and then make a probe that drives an affinity  ...  Expansion of this technology has broad applications in cell type-specific observation, manipulation, and therapeutics across species and disease models.  ...  Sections (40 µm) were cut on a cryostat and stored at 4°C in a solution of 30% glycerol/30% ethylene glycol.  ... 
doi:10.7554/elife.69571 pmid:35576146 pmcid:PMC9110026 fatcat:64otkqqmhjaszjabqqomdqxiva

Efficient NC algorithms for set cover with applications to learning and geometry

Bonnie Berger, John Rompel, Peter W. Shor
1994 Journal of computer and system sciences (Print)  
In addition, we give a linear-processor NC algorithm for a variant of the set cover problem first proposed by Chazelle and Friedman and use it to obtain NC algorithms for several problems in computational  ...  In this paper we give the first NC approximation algorithms for the unweighted and weighted set cover problems.  ...  ., 0(~ e [e[ +n)processors), runs in expected O(log 2 n log m log2(nm/e)/e 6) time, and produces a cover of weight at most (1 + e)(1 + In A)r*.  ... 
doi:10.1016/s0022-0000(05)80068-6 fatcat:pxhmqyr4frhz5imskbukzqf56e

Efficient NC algorithms for set cover with applications to learning and geometry

B. Berger, J. Rompel, P.W. Shor
1989 30th Annual Symposium on Foundations of Computer Science  
In addition, we give a linear-processor NC algorithm for a variant of the set cover problem first proposed by Chazelle and Friedman and use it to obtain NC algorithms for several problems in computational  ...  In this paper we give the first NC approximation algorithms for the unweighted and weighted set cover problems.  ...  ., 0(~ e [e[ +n)processors), runs in expected O(log 2 n log m log2(nm/e)/e 6) time, and produces a cover of weight at most (1 + e)(1 + In A)r*.  ... 
doi:10.1109/sfcs.1989.63455 dblp:conf/focs/BergerRS89 fatcat:jvmnartfpbguna7oam3hnspsom

Inland Ice Crystal Measurements at Eqe, West Greenland

M. Boyé, A. Cailleux
1954 Journal of Glaciology  
In other words the inland ice is too cold for the present climate to a depth of at least 100 m.  ...  Paul-Emile Victor, we found an opportunity for making crystal measurements by Sel igman's method 1 at Eqe, near Port-Quervai n (Iat. 69° 42' 56" N ., long. 50° o/' 50" \\1.), and we would like to acknowledge  ... 
doi:10.1017/s0022143000025156 fatcat:urrscmp3sfcxpbhspqbincax4e
« Previous Showing results 1 — 15 out of 1,071 results