نتایج جستجو برای: p center

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

2016
Deeparnab Chakrabarty Prachi Goyal Ravishankar Krishnaswamy

In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r1 ≥ · · · ≥ rk}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such that the union of balls of radius α · ri around the ith center covers all the points in X . This problem naturally...

Journal: :Discrete Applied Mathematics 1991
Jacob E. Goodman Richard Pollack

Goodman, J.E. and R. Pollack, The complexity of point configurations, Discrete Applied Mathematics 31 (1991) 167-180. There are several natural ways to extend the notion of the order of points on a line to higher dimensions. This article focuses on three of them-combinatorial type, order type, and isotopy class-and surveys work done in recent years on the efficient encoding of order types and o...

Journal: :Chemical physics 2009
Melih Sener Jen Hsin Leonardo G Trabuco Elizabeth Villa Pu Qian C Neil Hunter Klaus Schulten

The light-harvesting apparatus of the purple bacterial photosynthetic unit consists of a pool of peripheral light-harvesting complexes that transfer excitation energy to a reaction center (RC) via the surrounding pigment-protein complex LH1. Recent electron microscopy and atomic force microscopy studies have revealed that RC-LH1 units of Rhodobacter sphaeroides form membrane-bending dimeric com...

2015
Andreas Emil Feldmann

We consider the k-Center problem and some generalizations. For k-Center a set of k center vertices needs to be found in a graph G with edge lengths, such that the distance from any vertex of G to its nearest center is minimized. This problem naturally occurs in transportation networks, and therefore we model the inputs as graphs with bounded highway dimension, as proposed by Abraham et al. [SOD...

Journal: :CoRR 2013
Alina Ene Sariel Har-Peled Benjamin Raichel

We study the LowerBoundedCenter (LBC) problem, which is a clustering problem that can be viewed as a variant of the k-Center problem. In the LBC problem, we are given a set of points P in a metric space and a lower bound λ, and the goal is to select a set C ⊆ P of centers and an assignment that maps each point in P to a center of C such that each center of C is assigned at least λ points. The p...

2004
Garrison W. Cottrell Ronald W. Langacker Peter Norvig

This newsletter is produced and distributed by the CENTER FOR RESEARCH IN LANGUAGE, a research center at the University of California, San Diego, which unites the efforts of researchers in such disciplines as Linguistics, Cognitive Science, Psychology, Computer Science, Communication, Sociology, and Philosophy, all of whom share an interest in language. We regularly feature papers related to la...

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

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