An Iterative Randomized Rounding Algorithm for the k-Clustering Minimum Completion Problem with an Application in Telecommunication Field

2021 ◽  
pp. 410-422
Author(s):  
Mhand Hifi ◽  
Shohre Sadeghsa
Keyword(s):  
Randomized Rounding ◽  
Completion Problem ◽  
Rounding Algorithm

scholarly journals A Randomized Rounding Algorithm for Sparse PCA

2017 ◽  
Vol 11 (3) ◽  
pp. 1-26
Author(s):  
Kimon Fountoulakis ◽  
Abhisek Kundu ◽  
Eugenia-Maria Kontopoulou ◽  
Petros Drineas
Keyword(s):  
Randomized Rounding ◽  
Sparse Pca ◽  
Rounding Algorithm

scholarly journals The Totally Positive Completion Problem: The 3-by-n Case

2021 ◽  
Vol 9 (1) ◽  
pp. 226-239
Author(s):  
D. Carter ◽  
K.E. DiMarco ◽  
C.R. Johnson ◽  
L. Wedemeyer ◽  
Z. Yu
Keyword(s):  
Completion Problem ◽  
Totally Positive

Abstract The 3-by-n TP-completable patterns are characterized by identifying the minimal obstructions up to natural symmetries. They are finite in number.

The cyclic rank completion problem with regular blocks

2017 ◽  
Vol 66 (5) ◽  
pp. 861-868 ◽  
Author(s):  
Nir Cohen ◽  
Edgar Pereira
Keyword(s):  
Completion Problem

scholarly journals The Sudoku completion problem with rectangular hole pattern is NP-complete

2012 ◽  
Vol 312 (22) ◽  
pp. 3306-3315 ◽  
Author(s):  
Ramón Béjar ◽  
Cèsar Fernández ◽  
Carles Mateu ◽  
Magda Valls
Keyword(s):  
Rectangular Hole ◽  
Completion Problem ◽  
Np Complete

scholarly journals Graph-based service recommendation in Social Internet of Things

2021 ◽  
Vol 17 (4) ◽  
pp. 155014772110090
Author(s):  
Yuanyi Chen ◽  
Yanyun Tao ◽  
Zengwei Zheng ◽  
Dan Chen
Keyword(s):  
Internet Of Things ◽  
Social Relationships ◽  
Latent Variable ◽  
Smart Cities ◽  
Knowledge Graph ◽  
Service Recommendation ◽  
Variable Model ◽  
Completion Problem ◽  
Social Internet Of Things ◽  
Object Usage

While it is well understood that the emerging Social Internet of Things offers the capability of effectively integrating and managing massive heterogeneous IoT objects, it also presents new challenges for suggesting useful objects with certain service for users due to complex relationships in Social Internet of Things, such as user’s object usage pattern and various social relationships among Social Internet of Things objects. In this study, we focus on the problem of service recommendation in Social Internet of Things, which is very important for many applications such as urban computing, smart cities, and health care. We propose a graph-based service recommendation framework by jointly considering social relationships of heterogeneous objects in Social Internet of Things and user’s preferences. More exactly, we learn user’s preference from his or her object usage events with a latent variable model. Then, we model users, objects, and their relationships with a knowledge graph and regard Social Internet of Things service recommendation as a knowledge graph completion problem, where the “like” property that connects users to services needs to be predicted. To demonstrate the utility of the proposed model, we have built a Social Internet of Things testbed to validate our approach and the experimental results demonstrate its feasibility and effectiveness.

A Subnormal Completion Problem for Weighted Shifts on Directed Trees

2018 ◽  
Vol 90 (6) ◽  
Author(s):  
George R. Exner ◽  
Il Bong Jung ◽  
Jan Stochel ◽  
Hye Yeong Yun
Keyword(s):  
Weighted Shifts ◽  
Completion Problem
Sign in / Sign up

Export Citation Format

Share Document