نتایج جستجو برای: روش dmax

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

2008
Anupam Gupta Aaron Roth

where c(E(S, S̄)) is the sum of the weights of the edges that cross the cut, and D(S, S̄) is the sum of the demands of the pairs (si, ti) that are separated by the cut. We recall that optimizing over the set of cuts is equivalent to optimizing over `1 metrics, and is NP-hard. Instead, we may optimize over the set of all metrics. In this lecture, we bound the gap introduced by this relaxation by s...

Journal: :JoCG 2012
Mark de Berg Marcel Roeloffzen Bettina Speckmann

Over the past decade, the kinetic-data-structures framework has become the standard in computational geometry for dealing with moving objects. A fundamental assumption underlying the framework is that the motions of the objects are known in advance. This assumption severely limits the applicability of KDSs. We study KDSs in the black-box model, which is a hybrid of the KDS model and the traditi...

2017
G. Lazzari A. Terlizzi M.G. Leo G. Silvano

Background and purpose To investigate the hypothesis on low-dose bath exposure related to radiation-induced nausea and vomiting (RINV) in adjuvant breast volumetric modulated arch therapy (VMAT). Methods and materials A total of 106 consecutive breast cancer patients (pts) treated with adjuvant radiotherapy (RT) with VMAT from January 2013 to May 2016 were evaluated retrospectively. For each ...

2013
Bahman Bahmani Ashish Goel Kamesh Munagala

In this paper, we obtain improved algorithms for two graphtheoretic problems in the popular MapReduce framework. The first problem we consider is the densest subgraph problem. We present a primal-dual algorithm that provides a (1 + ) approximation and takes O( logn 2 ) MapReduce iterations, each iteration having a shuffle size of O(m) and a reduce-key-complexity of O(dmax). Here m is the number...

2014
Eda Yirmibeşoğlu Erkal Doğu Canoğlu Ahmet Kaya Görkem Aksu Binnaz Sarper Gür Akansel Tülay Meydancı Haldun Şükrü Erkal

BACKGORUND The aim of this study was to evaluate dysphagia in patients with head and neck cancer (HNC) undergoing three-dimensional conformal radiation therapy using objective and subjective tools simultaneously and to associate the clinical correlates of dysphagia with dosimetric parameters. METHODS Twenty patients were included in the study. The primary tumor and the involved lymph nodes (L...

2017
Bin Wang Shouming Chen Jun Yang Linghui Yang Jin Liu Wensheng Zhang

OBJECTIVE ET-26 HCl is a promising sedative-hypnotic anesthetic with virtually no effect on adrenocortical steroid synthesis. However, whether or not ET-26 HCl also has a sufficiently wide safety margin and hemodynamic stability similar to that of etomidate and related compounds remains unknown. In this study, the effects of ET-26 HCl, etomidate and propofol on therapeutic index, heart rate (HR...

2018
Matthew Mallory Damodar Pokhrel Rajeev Badkul Hongyu Jiang Christopher Lominska Fen Wang

PURPOSE/OBJECTIVES To retrospectively evaluate the plan quality, treatment efficiency, and accuracy of volumetric modulated arc therapy (VMAT) plans for thoracic spine metastases using stereotactic body radiotherapy (SBRT). MATERIALS/METHODS Seven patients with thoracic vertebral metastases treated with noncoplanar hybrid arcs (NCHA) (1 to 2 3D-conformal partial arcs +7 to 9 IMRT beams) were ...

Journal: :Geology 2021

Abstract Constraining the mechanisms of normal fault growth is essential for understanding extensional tectonics. Fault kinematics remain debated, mainly because very earliest phase deformation through recent syn-kinematic deposits rarely documented. To understand how underlying structures influence surface faulting, we examined in a 10 ka magmatically resurfaced region Krafla fissure swarm, Ic...

2015
Yun Yang Taoran Li Lulin Yuan Yaorong Ge Fang‐Fang Yin W. Robert Lee Q. Jackie Wu

A recent publication indicated that the patient anatomical feature (PAF) model was capable of predicting optimal objectives based on past experience. In this study, the benefits of IMRT optimization using PAF-predicted objectives as guidance for prostate were evaluated. Three different optimization methods were compared.1) Expert Plan: Ten prostate cases (16 plans) were planned by an expert pla...

2018
Mingyu Xiao Hiroshi Nagamochi

A graph G is called a pairwise compatibility graph (PCG, for short) if it admits a tuple (T,w, dmin, dmax) of a tree T whose leaf set is equal to the vertex set of G, a non-negative edge weight w, and two non-negative reals dmin ≤ dmax such that G has an edge between two vertices u, v ∈ V if and only if the distance between the two leaves u and v in the weighted tree (T, w) is in the interval [...

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

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