نتایج جستجو برای: spiral separator

تعداد نتایج: 35997  

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2005
Bin Fu

We introduce the notion of the width bounded geometric separator and develop the techniques for the existence of the width bounded separator in any d-dimensional Euclidean space. The separator is applied in obtaining 2 √ n) time exact algorithms for a class of NPcomplete geometric problems, whose previous algorithms take n √ n) time [2,5,1]. One of those problems is the well known disk covering...

Journal: :Kobunshi 2008

Journal: :The Laryngoscope 1911

Journal: :Eur. J. Comb. 2014
Nicolas Bousquet Aurélie Lagoutte Stéphan Thomassé

Yannakakis’ Clique versus Independent Set problem (CL− IS) in communication complexity asks for the minimum number of cuts separating cliques from stable sets in a graph, called CS-separator. Yannakakis provides a quasi-polynomial CS-separator, i.e. of size O(n), and addresses the problem of finding a polynomial CS-separator. This question is still open even for perfect graphs. We show that a p...

Journal: :International Journal of Engineering and Technical Research (IJETR) 2019

2016
Fenglin Huang Wenting Liu Peiying Li Jinxia Ning Qufu Wei

A superfine Li0.33La0.557TiO₃ (LLTO, 69.4 nm) was successfully synthesized by a facile solvent-thermal method to enhance the electrochemical properties of the lithium-ion battery separator. Co-axial nanofiber of cellulose and Poly(vinylidene fluoride-co-hexafluoropropylene) (PVDF-HFP) was prepared by a co-axial electrospinning technique, in which the shell material was PVDF-HFP and the core was...

Journal: :Discrete Mathematics 2018
Nicolas Bousquet Aurélie Lagoutte Frédéric Maffray Lucas Pastor

In a graph, a Clique-Stable Set separator (CS-separator) is a family C of cuts (bipartitions of the vertex set) such that for every clique K and every stable set S with K ∩S = ∅, there exists a cut (W,W ′) in C such that K ⊆W and S ⊆W ′. Starting from a question concerning extended formulations of the Stable Set polytope and a related complexity communication problem, Yannakakis [20] asked in 1...

Journal: :J. Comput. Syst. Sci. 1995
Michael T. Goodrich

We show how to construct an O p n separator decomposition of a planar graph G in O n time Such a decomposition de nes a binary tree where each node corresponds to a subgraph of G and stores an O p n separator of that subgraph We also show how to construct an O n way decomposition tree in parallel in O log n time so that each node corresponds to a subgraph of G and stores an O n separator of tha...

Journal: :Bioresource technology 2011
Xiaoyuan Zhang Shaoan Cheng Peng Liang Xia Huang Bruce E Logan

The combined use of brush anodes and glass fiber (GF1) separators, and plastic mesh supporters were used here for the first time to create a scalable microbial fuel cell architecture. Separators prevented short circuiting of closely-spaced electrodes, and cathode supporters were used to avoid water gaps between the separator and cathode that can reduce power production. The maximum power densit...

Journal: :Biotechnology and bioengineering 2002
Volker M Gorenflo Laura Smith Bob Dedinsky Bo Persson James M Piret

Acoustic cell retention devices have provided a practical alternative for up to 50 L/day perfusion cultures but further scale-up has been limited. A novel temperature-controlled and larger-scale acoustic separator was evaluated at up to 400 L/day for a 10(7) CHO cell/mL perfusion culture using a 100-L bioreactor that produced up to 34 g/day recombinant protein. The increased active volume of th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید