Omer Barkol

Affiliations:
  • Hewlett Packard Enterprise Labs, Haifa, Israel


According to our database1, Omer Barkol authored at least 17 papers between 2000 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Multi-source uncertain entity resolution: Transforming holocaust victim reports into people.
Inf. Syst., 2017

2016
Multi-Source Uncertain Entity Resolution at Yad Vashem: Transforming Holocaust Victim Reports into People.
Proceedings of the 2016 International Conference on Management of Data, 2016

2013
Approximate graph mining with label costs.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
Web Interface Interpretation Using Graph Grammars.
IEEE Trans. Syst. Man Cybern. Part C, 2012

Graph mining for discovering infrastructure patterns in configuration management databases.
Knowl. Inf. Syst., 2012

2011
Visibly Pushdown Languages for a GUI Parsing Application with Probabilistic Lexer.
Proceedings of the 5th IEEE International Conference on Semantic Computing (ICSC 2011), 2011

Automatic Policy Rule Extraction for Configuration Management.
Proceedings of the POLICY 2011, 2011

Infrastructure Pattern Discovery in Configuration Management Databases via Large Sparse Graph Mining.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

A New Frequent Similar Tree Algorithm Motivated by Dom Mining - Using RTDM and its New Variant - SiSTeR.
Proceedings of the KDIR 2011, 2011

2010
On <i>d</i>-Multiplicative Secret Sharing.
J. Cryptol., 2010

On Locally Decodable Codes, Self-Correctable Codes, and <i>t</i>-Private PIR.
Algorithmica, 2010

A robust similarity measure for automatic inspection.
Proceedings of the International Conference on Image Processing, 2010

2008
Locally decodable codes and their applications.
PhD thesis, 2008

Communication in the presence of replication.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2005
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems.
Proceedings of the Advances in Cryptology, 2005

2002
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model.
J. Comput. Syst. Sci., 2002

2000
Tighter bounds for nearest neighbor search and related problems in the cell probe model.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000


  Loading...