Planning in compute-aggregate problems as optimization problems on graphs

Pavel Chuprikov; Alex Davydow; Kirill Kogan; Sergey I. Nikolenko; Alexander V. Sirotkin

doi:10.1109/ICNP.2017.8117579

Planning in compute-aggregate problems as optimization problems on graphs

Pavel Chuprikov, Alex Davydow, Kirill Kogan, Sergey I. Nikolenko, Alexander V. Sirotkin

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

2 ציטוטים ‏(Scopus)

תקציר

Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.

שפה מקורית	אנגלית
כותר פרסום המארח	2017 IEEE 25th International Conference on Network Protocols, ICNP 2017
מוציא לאור	IEEE Computer Society
מסת"ב (אלקטרוני)	9781509065011
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1109/ICNP.2017.8117579
סטטוס פרסום	פורסם - 21 נוב׳ 2017
פורסם באופן חיצוני	כן
אירוע	25th IEEE International Conference on Network Protocols, ICNP 2017 - Toronto, קנדה משך הזמן: 10 אוק׳ 2017 → 13 אוק׳ 2017

סדרות פרסומים

שם	Proceedings - International Conference on Network Protocols, ICNP
כרך	2017-October
ISSN (מודפס)	1092-1648

כנס

כנס	25th IEEE International Conference on Network Protocols, ICNP 2017
מדינה/אזור	קנדה
עיר	Toronto
תקופה	10/10/17 → 13/10/17

גישה למסמך

10.1109/ICNP.2017.8117579

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

Chuprikov, P., Davydow, A., Kogan, K., Nikolenko, S. I., & Sirotkin, A. V. (2017). Planning in compute-aggregate problems as optimization problems on graphs. ב- 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017 המאמר 8117579 (Proceedings - International Conference on Network Protocols, ICNP; כרך 2017-October). IEEE Computer Society. https://doi.org/10.1109/ICNP.2017.8117579

@inproceedings{016282e198a44d2f83221a4bbd599509,

title = "Planning in compute-aggregate problems as optimization problems on graphs",

abstract = "Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.",

author = "Pavel Chuprikov and Alex Davydow and Kirill Kogan and Nikolenko, {Sergey I.} and Sirotkin, {Alexander V.}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 25th IEEE International Conference on Network Protocols, ICNP 2017 ; Conference date: 10-10-2017 Through 13-10-2017",

year = "2017",

month = nov,

day = "21",

doi = "10.1109/ICNP.2017.8117579",

language = "אנגלית",

series = "Proceedings - International Conference on Network Protocols, ICNP",

publisher = "IEEE Computer Society",

booktitle = "2017 IEEE 25th International Conference on Network Protocols, ICNP 2017",

address = "ארצות הברית",

}

Chuprikov, P, Davydow, A, Kogan, K, Nikolenko, SI & Sirotkin, AV 2017, Planning in compute-aggregate problems as optimization problems on graphs. ב- 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017., 8117579, Proceedings - International Conference on Network Protocols, ICNP, כרך 2017-October, IEEE Computer Society, 25th IEEE International Conference on Network Protocols, ICNP 2017, Toronto, קנדה, 10/10/17. https://doi.org/10.1109/ICNP.2017.8117579

Planning in compute-aggregate problems as optimization problems on graphs. / Chuprikov, Pavel; Davydow, Alex; Kogan, Kirill et al.
2017 IEEE 25th International Conference on Network Protocols, ICNP 2017. IEEE Computer Society, 2017. 8117579 (Proceedings - International Conference on Network Protocols, ICNP; כרך 2017-October).

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

TY - GEN

T1 - Planning in compute-aggregate problems as optimization problems on graphs

AU - Chuprikov, Pavel

AU - Davydow, Alex

AU - Kogan, Kirill

AU - Nikolenko, Sergey I.

AU - Sirotkin, Alexander V.

PY - 2017/11/21

Y1 - 2017/11/21

N2 - Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.

AB - Efficient representation of data aggregations is a fundamental problem in modern big data applications. We present a formalization of compute-aggregate planning parameterized by the aggregation function.

UR - http://www.scopus.com/inward/record.url?scp=85041384542&partnerID=8YFLogxK

U2 - 10.1109/ICNP.2017.8117579

DO - 10.1109/ICNP.2017.8117579

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85041384542

T3 - Proceedings - International Conference on Network Protocols, ICNP

BT - 2017 IEEE 25th International Conference on Network Protocols, ICNP 2017

PB - IEEE Computer Society

T2 - 25th IEEE International Conference on Network Protocols, ICNP 2017

Y2 - 10 October 2017 through 13 October 2017

ER -

Planning in compute-aggregate problems as optimization problems on graphs

תקציר

סדרות פרסומים

כנס

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי