I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Analyzing and Predicting the Popularity of Online Contents:
, In:
Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services
,
Nguyen, Minh-Tri
;
Nakajima, Takuma
;
Yoshimi, Masato
. - p. 93-102 , 2019
Link:
https://dl.acm.org/doi/10.1145/3366030.3366047
RT T1 <cTitle>Proceedings of the 21st International Conference on Information Integration and Web-based Applications & Services</cTitle>: T1 <Title>Analyzing and Predicting the Popularity of Online Contents</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3366047&Exemplar=1&LAN=DE A1 Nguyen, Minh-Tri A1 Nakajima, Takuma A1 Yoshimi, Masato A1 Thoai, Nam PB ACM YR 2019 K1 Youtube video K1 machine learning K1 network traffic K1 time series prediction K1 Networks K1 Network algorithms K1 Control path algorithms K1 Network resources allocation K1 Network economics K1 Traffic engineering algorithms K1 Network design and planning algorithms SP 93 OP 102 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3366030.3366047 DO https://dl.acm.org/doi/10.1145/3366030.3366047 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
