Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Ran Wolff"'
Publikováno v:
The Journal of Industrial Economics. 70:493-524
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::998451b225a1e29520f532dbc989139f
https://doi.org/10.1111/joie.12296
https://doi.org/10.1111/joie.12296
Publikováno v:
Information Economics and Policy. 42:56-65
There is an increasing number of Collaborative Question Answering (CQA) websites and a growing reliance of the online community on user-generated content. In this paper, we study users’ motivation to win social recognition contests (best answers) a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34eca29b0640f49aa2fb1c374c45380
https://doi.org/10.1016/j.infoecopol.2017.08.001
https://doi.org/10.1016/j.infoecopol.2017.08.001
Autor:
Ran Wolff, Murad Badarna
Publikováno v:
Statistical Analysis and Data Mining: The ASA Data Science Journal. 7:125-139
Change detection is one of the most important tasks in time series analysis. When the series is very long, or when it is rapidly updated, it has to be treated as a stream. This means that the change detection algorithm must process each sample in O 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f032751a386638d1795414bf52c1ffe
https://doi.org/10.1002/sam.11216
https://doi.org/10.1002/sam.11216
Autor:
Ran Wolff
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 26:916-928
Local thresholding algorithms were first presented more than a decade ago and have since been applied to a variety of data mining tasks in peer-to-peer systems, wireless sensor networks, and in grid systems. One critical assumption made by those algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::361031e9ad64d9fa9c70ebfcf91116ab
https://doi.org/10.1109/tkde.2013.59
https://doi.org/10.1109/tkde.2013.59
Publikováno v:
WSDM
We study the problem of k-anonymization of mail messages in the realistic scenario of auditing mail traffic in a major commercial Web mail service. Mail auditing is necessary in various Web mail debugging and quality assurance activities, such as ant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::417d76f85aece5fcea1b160f7d2884ee
https://doi.org/10.1145/2835776.2835803
https://doi.org/10.1145/2835776.2835803
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 21:465-478
In a large network of computers or wireless sensors, each of the components (henceforth, peers) has some data about the global state of the system. Much of the system's functionality such as message routing, information retrieval and load sharing rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50b72bc13f531e8f1a3a1f51ed32f151
https://doi.org/10.1109/tkde.2008.169
https://doi.org/10.1109/tkde.2008.169
Publikováno v:
Statistical Analysis and Data Mining: The ASA Data Science Journal. 1:85-103
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83bf1df8ee22a78a0d2ebcd72892bf37
https://doi.org/10.1002/sam.10006
https://doi.org/10.1002/sam.10006
Publikováno v:
Journal of Grid Computing. 5:361-378
In a facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of facilities to open, such that the clients will be served at a minimal cos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4998a8f2fde839db8e3672c5e29bb09b
https://doi.org/10.1007/s10723-007-9069-5
https://doi.org/10.1007/s10723-007-9069-5
Publikováno v:
The VLDB Journal. 17:789-804
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in the learning examples. Our extension provides a tool that measures th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::edd89c2fc4f287043bc922aa6d892dea
https://doi.org/10.1007/s00778-006-0039-5
https://doi.org/10.1007/s00778-006-0039-5
Autor:
Ran Wolff
Publikováno v:
PODC
Over the last fifteen years, a large group of algorithms emerged which compute various predicates from distributed data with a focus on communication efficiency. These algorithms are often called "communication-efficient", "geometric-monitoring", or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4dd070532277809c74da1650688ee31
https://doi.org/10.1145/2767386.2767387
https://doi.org/10.1145/2767386.2767387