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
المعرِّفات الرقمية للأشياء	https://doi.org/10.1109/ICNP.2017.8117579
حالة النشر	نُشِر - 21 نوفمبر 2017
منشور خارجيًا	نعم
الحدث	25th IEEE International Conference on Network Protocols, ICNP 2017 - Toronto, كندا المدة: ١٠ أكتوبر ٢٠١٧ → ١٣ أكتوبر ٢٠١٧

سلسلة المنشورات

الاسم	Proceedings - International Conference on Network Protocols, ICNP
مستوى الصوت	2017-October
رقم المعيار الدولي للدوريات (المطبوع)	1092-1648

!!Conference

!!Conference	25th IEEE International Conference on Network Protocols, ICNP 2017
الدولة/الإقليم	كندا
المدينة	Toronto
المدة	١٠/١٠/١٧ → ١٣/١٠/١٧

الوصول إلى المستند

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, كندا, ١٠/١٠/١٧. https://doi.org/10.1109/ICNP.2017.8117579

Planning in compute-aggregate problems as optimization problems on graphs. / Chuprikov, Pavel; Davydow, Alex; Kogan, Kirill وآخرون.
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

ملخص

سلسلة المنشورات

!!Conference

الوصول إلى المستند

الملفات والروابط الأخرى

بصمة

قم بذكر هذا