Loading...
Search for: input-set
0.005 seconds

    Distributed unit clustering

    , Article 31st Canadian Conference on Computational Geometry, CCCG 2019, 8 August 2019 through 10 August 2019 ; 2019 , Pages 236-241 Mirjalali, K ; Tabatabaee, S. A ; Zarrabi Zadeh, H ; Sharif University of Technology
    Canadian Conference on Computational Geometry  2019
    Abstract
    Given a set of points in the plane, the unit clustering problem asks for finding a minimum-size set of unit disks that cover the whole input set. We study the unit clustering problem in a distributed setting, where input data is partitioned among several machines. We present a (3 + ϵ)-approximation algorithm for the problem in the Euclidean plane, and a (4 + ϵ)-approximation algorithm for the problem under general Lp metric (p1). We also study the capacitated version of the problem, where each cluster has a limited capacity for covering the points. We present a distributed algorithm for the capacitated version of the problem that achieves an approximation factor of 4+" in the L2 plane, and a... 

    Distributed unit clustering

    , Article 31st Canadian Conference on Computational Geometry, CCCG 2019, 8 August 2019 through 10 August 2019 ; 2019 , Pages 236-241 Mirjalali, K ; Tabatabaee, S.A ; Zarrabi Zadeh, H ; Elsevier; PIMS; University of Alberta ; Sharif University of Technology
    Canadian Conference on Computational Geometry  2019
    Abstract
    Given a set of points in the plane, the unit clustering problem asks for finding a minimum-size set of unit disks that cover the whole input set. We study the unit clustering problem in a distributed setting, where input data is partitioned among several machines. We present a (3 + ϵ)-approximation algorithm for the problem in the Euclidean plane, and a (4 + ϵ)-approximation algorithm for the problem under general Lp metric (p1). We also study the capacitated version of the problem, where each cluster has a limited capacity for covering the points. We present a distributed algorithm for the capacitated version of the problem that achieves an approximation factor of 4+" in the L2 plane, and a... 

    An enhanced neural network model for predictive control of granule quality characteristics

    , Article Scientia Iranica ; Volume 18, Issue 3 E , 2011 , Pages 722-730 ; 10263098 (ISSN) Neshat, N ; Mahloojifl, H ; Kazemi, A ; Sharif University of Technology
    2011
    Abstract
    An integrated approach is presented for predicting granule particle size using Partial Correlation (PC) analysis and Artificial Neural Networks (ANNs). In this approach, the proposed model is an abstract form from the ANN model, which intends to reduce model complexity via reducing the dimension of the input set and consequently improving the generalization capability of the model. This study involves comparing the capability of the proposed model in predicting granule particle size with those obtained from ANN and Multi Linear Regression models, with respect to some indicators. The numerical results confirm the superiority of the proposed model over the others in the prediction of granule...