( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Predicting the Top-N Popular Videos via a Cross-Domain Hybrid Model.

, и . IEEE Trans. Multim., 21 (1): 147-156 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Zhiyi Ding

Zhiyi Lv

Dao Tan

Albert Tan

Vivien Tan

 

Другие публикации лиц с тем же именем

Tight lower bounds for semi-online scheduling on two uniform machines with known optimum., , , , и . Central Eur. J. Oper. Res., 27 (4): 1107-1130 (2019)Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time., , и . Inf. Sci., (2013)Semi-on-line problems on two identical machines with combined partial information., и . Oper. Res. Lett., 30 (6): 408-414 (2002)Two semi-online scheduling problems on two uniform machines., , , и . Theor. Comput. Sci., 410 (8-10): 776-792 (2009)On the machine scheduling problem with job delivery coordination., , и . Eur. J. Oper. Res., 182 (3): 1057-1072 (2007)Optimal Semi-online Scheduling Algorithms on a Small Number of Machines., , и . ESCAPE, том 4614 из Lecture Notes in Computer Science, стр. 504-515. Springer, (2007)Privacy-preserving vertically partitioned linear program with nonnegativity constraints., , и . Optim. Lett., 7 (8): 1725-1731 (2013)On the optimality of list scheduling for online uniform machines scheduling., , и . Optim. Lett., 6 (7): 1551-1571 (2012)Scheduling to minimize the maximum total completion time per machine., , , , и . Eur. J. Oper. Res., 242 (1): 45-50 (2015)A note on the lower bound for the Price of Anarchy of scheduling games on unrelated machines., , и . Discret. Appl. Math., (2015)