نتایج جستجو برای: lotus inside a circle graph
تعداد نتایج: 13468301 فیلتر نتایج به سال:
Here are the key ideas and results. • The output of linear time invariant system is the convolution of its impulse response and the input. The system is bounded iff its impulse response is summable. • The transfer function is the Fourier transform of the impulse response. • A system with rational transfer function is causal if the poles are inside the unit circle. It is causally invertible if t...
• The smallest minimum color-spanning circle (S-MCSC) problem can be solved in O ( n k log ) time. largest (L-MCSC) is NP-Hard. A 1 3 -factor 2 , if no two distinct color disks intersect) approximation to the L-MCSC computed Let R a set of colored imprecise points, where each point by one colors. Each specified unit disk which lies. We study computing and possible spanning circle, among all c...
We have developed a menu-driven computer program (CARDIO), based on a Lotus 1-2-3 template and a series of macrocommands, that rapidly and semiautomatically calculates cardiac output from dye or thermal dilution curves. CARDIO works with any dye or thermal dilution recorder with an analog output, any analog to digital (A-to-D) conversion system, and any computer capable of running Lotus 1-2-3 v...
The intersection graph of a family of arcs on a circle is called a circular-arc graph. This class of graphs admits some interesting subclasses: proper circular-arc graphs, unit circular-arc graphs, Helly circular-arc graphs and clique-Helly circular-arc graphs. In this paper, all possible intersections of these subclasses are studied. There are thirteen regions. Twelve of these are nonempty, an...
In the random k-uniform hypergraph Hk(n, p) on a vertex set V of size n, each subset of size k of V independently belongs to it with probability p. Motivated by a theorem of Erdős and Rényi [6] regarding when a random graph G(n, p) = H2(n, p) has a perfect matching, Schmidt and Shamir [14] essentially conjectured the following. Conjecture Let k|n for fixed k ≥ 3, and the expected degree d(n, p)...
Besides its important significance in plant taxonomy and phylogeny, sacred lotus (Nelumbo nucifera Gaertn.) might also hold the key to the secrets of aging, which attracts crescent attentions from researchers all over the world. The genetic or molecular studies on this species depend on its genome information. In 2013, two publications reported the sequencing of its full genome, based on which ...
In this paper, we incorporate shape detection into contextual scene labeling and make use of both shape, texture, and context information in a graphical representation. We propose a candidacy graph, whose vertices are two types of recognition candidates for either a superpixel or a window patch. The superpixel candidates are generated by a discriminative classifier with textural features as wel...
Lotus leaves have become an icon for superhydrophobicity and self-cleaning surfaces, and have led to the concept of the 'Lotus effect'. Although many other plants have superhydrophobic surfaces with almost similar contact angles, the lotus shows better stability and perfection of its water repellency. Here, we compare the relevant properties such as the micro- and nano-structure, the chemical c...
We have isolated a Lotus japonicus cDNA for pantothenate (vitamin B(5)) synthetase (PS) by functional complementation of an Escherichia coli panC mutant (AT1371). A rice (Oryza sativum) expressed sequence tag, identified by sequence similarity to PS, was also able to complement the E. coli auxotroph, as was an open reading frame from Saccharomyces cerevisiae (baker's yeast). The Lotus and rice ...
We consider the problem of designing succinct navigational oracles, i.e., data structures supporting basic queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a circle, which include graph classes circle graphs, k-polygon-circle circle-trapezoid trapezoid graphs. The degree query reports number incident edges to given vertex, asks if there is an edge betwee...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید