Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Omer Barkol"'
Publikováno v:
Information Systems. 65:124-136
In this work we present a multi-source uncertain entity resolution model and show its implementation in a use case of Yad Vashem, the central repository of Holocaust-era information. The Yad Vashem dataset is unique with respect to classic entity res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9196fed3a4318844a6022b3b2e46d0f
https://doi.org/10.1016/j.is.2016.12.003
https://doi.org/10.1016/j.is.2016.12.003
Publikováno v:
SIGMOD Conference
In this work we describe an entity resolution project performed at Yad Vashem, the central repository of Holocaust-era information. The Yad Vashem dataset is unique with respect to classic entity resolution, by virtue of being both massively multi-so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e4620888c76c5ce06b16b3d3eb2dbef
https://doi.org/10.1145/2882903.2903737
https://doi.org/10.1145/2882903.2903737
Autor:
Pranay Anchuri, Ruth Bergman, Shahar Golan, Yifat Felder, Mohammed J. Zaki, Arik Sityon, Omer Barkol
Publikováno v:
Knowledge and Information Systems. 33:491-522
A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their interrelationships. Mining such graphs is challenging because they are large, complex, and multi-attributed and hav
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82b40a793d8daabba85ff7d3b545a7ce
https://doi.org/10.1007/s10115-012-0528-3
https://doi.org/10.1007/s10115-012-0528-3
Publikováno v:
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews). 42:590-602
With the advent of the Internet, it is desirable to interpret and extract useful information from the Web. One major challenge in Web interface interpretation is to discover the semantic structure underlying a Web interface. Many heuristic approaches
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::083ad2bf0068dea7fb42d33d84ad3c67
https://doi.org/10.1109/tsmcc.2011.2171335
https://doi.org/10.1109/tsmcc.2011.2171335
Publikováno v:
Journal of Cryptology. 23:580-593
A multiplicative secret sharing scheme allows players to multiply two secret-shared field elements by locally converting their shares of the two secrets into an additive sharing of their product. Multiplicative secret sharing serves as a central buil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba72f9036bd6c25f5dfa844376f3f0e9
https://doi.org/10.1007/s00145-010-9056-z
https://doi.org/10.1007/s00145-010-9056-z
Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining
Autor:
Omer Barkol, Mohammed J. Zaki, Pranay Anchuri, Ruth Bergman, Arik Sityon, Yifat Felder, Shahar Golan
Publikováno v:
ICDM
A configuration management database (CMDB) can be considered to be a large graph representing the IT infrastructure entities and their inter-relationships. Mining such graphs is challenging because they are large, complex, and multi-attributed, and h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a532ad8b07672520973e30df3c160148
https://doi.org/10.1109/icdm.2011.81
https://doi.org/10.1109/icdm.2011.81
Publikováno v:
ICSC
Automatic understanding of GUI (Graphic User Interfaces) is vitally important for applications such as quality assurance, user monitoring, speech activated devices, automatic generation of GUI for application accessibility, and GUI design. Likewise,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9af0b372b5cf858c50b838b33b6037b4
https://doi.org/10.1109/icsc.2011.64
https://doi.org/10.1109/icsc.2011.64
Publikováno v:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques ISBN: 9783540742074
APPROX-RANDOM
APPROX-RANDOM
A k-query locally decodable code(LDC) allows to probabilistically decode any bit of an encoded message by probing only kbits of its corrupted encoding. A stronger and desirable property is that of self-correction, allowing to efficiently recover not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf4a339bdf7a265f057d135caa2c8acc
https://doi.org/10.1007/978-3-540-74208-1_23
https://doi.org/10.1007/978-3-540-74208-1_23
Autor:
Yuval Ishai, Omer Barkol
Publikováno v:
Advances in Cryptology – CRYPTO 2005 ISBN: 9783540281146
CRYPTO
CRYPTO
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for a constant-depth circuit C of size s with an m-bit input x, we obtain t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a34909ca5c45eb61ce90f064845aeabe
https://doi.org/10.1007/11535218_24
https://doi.org/10.1007/11535218_24
Autor:
Yuval Rabani, Omer Barkol
Publikováno v:
STOC
We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a49bdf46381a4495174a2c86498b33d4
https://doi.org/10.1145/335305.335350
https://doi.org/10.1145/335305.335350