نتایج جستجو برای: prune
تعداد نتایج: 2684 فیلتر نتایج به سال:
δ-Complete decision procedures can solve SMT problems over the reals with a wide range of nonlinear functions, allowing “δ-bounded errors”. The scalability of such procedures usually depends on efficient numerical procedures, whose implementation can be error-prone. It is important for δ-complete solvers to provide certificates to prove the correctness of their answers. We show how to do this f...
The Molecular Distance Geometry Problem, which asks to find the embedding in R of a given weighted undirected graph, is a good model for determining the structure of proteins given a set of inter-atomic distances [6,4]. Its generalization to R is called Distance Geometry Problem (DGP), which has applications in wireless sensor networks [2] and graph drawing. In general, the MDGP and DGP implici...
Using data from a simulated cup drawing process, we demonstrate how the inherent geometrical structure of meshes can be used to effectively prune an artificial neural network in straightforward way.
'Prune-Belly" is the name given to the disease which is characterized by a congenital wrinkled appearance of the abdomen. Usually, a triad of congenital anomalies highlights the components of the prune-belly syndrome. This triad consists of undescended testicles, abdominal musculature deficiency and urinary tract abnormalities. The previously described triad of the syndrome is by no means the t...
The awd gene of Drosophila melanogaster encodes a nucleoside diphosphate kinase. Killer of prune (Kpn) is a mutation in the awd gene which substitutes Ser for Pro at position 97 and causes dominant lethality in individuals that do not have a functional prune gene. This lethality is not due to an inadequate amount of nucleoside diphosphate (NDP) kinase activity. In order to understand why the pr...
We present a new algorithm, A*Prune, to list (in order of increasing length) the first K Multiple-Constrained-Shortest-Path (KMCSP) between a given pair of nodes in a digraph in which each arc is associated with multiple Quality-of-Service (QoS) metrics. The algorithm constructs paths starting at the source and going towards the destination. But, at each iteration, the algorithm gets rid of all...
The complementary lethal interaction between the prune (pn) and Killer of prune loci of Drosophila melanogaster is an unusual and highly specific phenomenon. A lesion in pn results in a brownish-purple color of the compound eyes, while the conditional dominant Killer of prune mutation exhibits no phenotype by itself. However, a hemizygous or homozygous pn mutant carrying a copy of the Killer of...
The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. We maintain the set of points under insertions and deletions of points and we are able to report an approximation of the width of this dynamic point set. Our data structure takes linear space and allows for reporting the approximation with relative accuracy in O( p 1= logn) time...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید