نتایج جستجو برای: supporting points

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

2010
S. Caraian

This paper presents a method for robustly identifying the manipulability of objects in a scene based on the capabilities of the manipulator. The method uses a directed histogram search of a time-of-flight camera generated 3D point cloud that exploits the logical connection between objects and the respective supporting surface to facilitate scene segmentation. Once segmented the points above the...

2012
Luis Barba

We show that a set P of n points in the plane can be preprocessed in O(n log n)-time to construct a data structure supporting O(log n)-time queries of the following form: Find the minimum enclosing circle of P with center on a given disk.

Journal: :Clinical infectious diseases : an official publication of the Infectious Diseases Society of America 2012
Romney M Humphries Ferric C Fang Frank M Aarestrup Janet A Hindler

Fluoroquinolone (FQ) resistance in Salmonella enterica is a significant clinical concern. Recognition of resistance by the clinical laboratory is complicated by the multiple FQ resistance mechanisms found in Salmonella. The Clinical Laboratory Standards Institute (CLSI) recently addressed this issue by revising the ciprofloxacin break points for Salmonella species. It is critical for clinicians...

2014
Gerth Stølting Brodal Kasper Green Larsen

The skyline of a set of points in the plane is the subset of maximal points, where a point (x, y) is maximal if no other point (x′, y′) satisfies x′ ≥ x and y′ ≥ x. We consider the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle R to report the size of the skyline of P ∩ R. We ...

2017
Michael Kleyman Emre Sefer Teodora Nicola Celia Espinoza Divya Chhabra James S Hagood Naftali Kaminski Namasivayam Ambalavanan Ziv Bar-Joseph

Biological systems are increasingly being studied by high throughput profiling of molecular data over time. Determining the set of time points to sample in studies that profile several different types of molecular data is still challenging. Here we present the Time Point Selection (TPS) method that solves this combinatorial problem in a principled and practical way. TPS utilizes expression data...

2007
Yuri Pritykin

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.

Journal: :The Journal of perinatal education 2015
Debby Amis

Sarah Buckley's game-changing report, Hormonal Physiology of Childbearing: Evidence and Implications for Women, Babies, and Maternity Care, provides the evidence that supporting, promoting, and protecting the normal physiology of childbirth produces the best outcomes for mothers and babies. In this article, a childbirth educator recommends key points from Buckley's report that should be include...

2012
Philip Guise

Sub-Tenon's block has become the most common technique of orbital regional anesthesia in many centers. It provides effective anesthesia to the orbit with a lower incidence of sight-threatening complications than sharp needle techniques. This article will discuss the relevant anatomy, finer points of sub-Tenon's block technique, and the evidence supporting its safety.

2015
Subhroshekhar Ghosh Yuval Peres

Let Π be a translation invariant point process on the complex plane C and let D ⊂ C be a bounded open set. We ask what does the point configuration Πout obtained by taking the points of Π outside D tell us about the point configuration Πin of Π inside D? We show that for the Ginibre ensemble, Πout determines the number of points in Πin. For the translation-invariant zero process of a planar Gau...

2016
Gerth Stølting Brodal

An external memory data structure is presented for maintaining a dynamic set ofN two-dimensional points under the insertion and deletion of points, and supporting unsorted 3-sided range reporting queries and top-k queries, where top-k queries report the k points with highest y-value within a given x-range. For any constant 0 < ε ≤ 1 2 , a data structure is constructed that supports updates in a...

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

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