Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Noa Avigdor-Elgrabli"'
Publikováno v:
CIKM
In the typical state of an ever growing mailbox, it becomes essential to assist the user to better organize and quickly look up the content of his electronic life. Our work addresses this challenge, by identifying related messages within a user's mai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74c8774ca467e076394dd90967a9fd16
https://doi.org/10.1145/3269206.3269255
https://doi.org/10.1145/3269206.3269255
Autor:
Noa Avigdor-Elgrabli, Yuval Rabani
Publikováno v:
ACM Transactions on Algorithms. 11:1-15
We design and analyze an online reordering buffer management algorithm with improved O (log k /log log k ) competitive ratio for nonuniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Engle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::462f6f6001d6eedb94bc4447084baabb
https://doi.org/10.1145/2663347
https://doi.org/10.1145/2663347
Autor:
Yoelle Maarek, Dotan Di Castro, Liane Lewin-Eytan, Iftah Gamzu, Irena Grabovitch-Zuyev, Mark Cwalinski, Noa Avigdor-Elgrabli
Publikováno v:
CIKM
Several recent studies have presented different approaches for clustering and classifying machine-generated mail based on email headers. We propose to expand these approaches by considering email message bodies. We argue that our approach can help in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08605f76e02de8805ac5fc4d26929e6d
https://doi.org/10.1145/2983323.2983350
https://doi.org/10.1145/2983323.2983350
Publikováno v:
SIAM Journal on Computing. 41:1110-1121
In this work we study the problem of bipartite correlation clustering (BCC), a natural bipartite counterpart of the well-studied correlation clustering (CC) problem [N. Bansal, A. Blum, and S. Chawla, Machine Learning, 56 (2004), pp. 89--113], also r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e33e2928c4515faa47557165445aa1f1
https://doi.org/10.1137/110848712
https://doi.org/10.1137/110848712
Autor:
Dana Drachsler-Cohen, Oren Anava, Oren Somekh, Michal Aharon, Shahar Golan, Noa Avigdor-Elgrabli
Publikováno v:
RecSys
The item cold-start problem is of a great importance in collaborative filtering (CF) recommendation systems. It arises when new items are added to the inventory and the system cannot model them properly since it relies solely on historical users' int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c83a260644929ac524d86a0235f2856
https://doi.org/10.1145/2792838.2800183
https://doi.org/10.1145/2792838.2800183
Publikováno v:
WWW
We study a natural generalization of the correlation clustering problem to graphs in which the pairwise relations between objects are categorical instead of binary. This problem was recently introduced by Bonchi et al. under the name of chromatic cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed32436a299aab928ec9386dcaa7dde7
https://doi.org/10.1145/2736277.2741629
https://doi.org/10.1145/2736277.2741629
Publikováno v:
Automata, Languages, and Programming ISBN: 9783662476710
ICALP (1)
ICALP (1)
Reordering buffer management (RBM) is an elegant theoretical model that captures the tradeoff between buffer size and switching costs for a variety of reordering/sequencing problems. In this problem, colored items arrive over time, and are placed in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3f4f600dd5edc22e90ecbba93393a18
https://doi.org/10.1007/978-3-662-47672-7_7
https://doi.org/10.1007/978-3-662-47672-7_7
Autor:
Noa Avigdor-Elgrabli, Yuval Rabani
We give an $O(\log\log k)$-competitive randomized online algorithm for reordering buffer management, where $k$ is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed onli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39b1ce0d950f027f4d42d17750109e66
Publikováno v:
Algorithms – ESA 2011 ISBN: 9783642237188
ESA
ESA
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipartite graph, the objective of BCC is to generate a set of vertex-disjoin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c15a1edac1ae519f369a553dab5bf0f1
https://doi.org/10.1007/978-3-642-23719-5_3
https://doi.org/10.1007/978-3-642-23719-5_3