Avraham A. Melkman

According to our database, Avraham A. Melkman authored at least 25 papers between 1978 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the Compressive Power of Boolean Threshold Autoencoders.

Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu

IEEE Trans. Neural Networks Learn. Syst., February, 2023

On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest.

Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu

CoRR, 2023

Shortest Longest-Path Graph Orientations.

Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2021

On the Size and Width of the Decoder of a Boolean Threshold Autoencoder.

Tatsuya Akutsu, Avraham A. Melkman

CoRR, 2021

2020

Extracting boolean and probabilistic rules from trained neural networks.

Pengyu Liu, Avraham A. Melkman, Tatsuya Akutsu

Neural Networks, 2020

Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree.

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura

Int. J. Found. Comput. Sci., 2020

2019

Identification of the Structure of a Probabilistic Boolean Network From Samples Including Frequencies of Outcomes.

Tatsuya Akutsu, Avraham A. Melkman

IEEE Trans. Neural Networks Learn. Syst., 2019

2018

Identifying a Probabilistic Boolean Threshold Network From Samples.

Avraham A. Melkman, Xiaoqing Cheng, Wai-Ki Ching, Tatsuya Akutsu

IEEE Trans. Neural Networks Learn. Syst., 2018

2015

On the complexity of finding a largest common subtree of bounded degree.

Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu

Theor. Comput. Sci., 2015

2013

An Improved Satisfiability Algorithm for Nested Canalyzing Functions and its Application to Determining a Singleton Attractor of a Boolean Network.

Avraham A. Melkman, Tatsuya Akutsu

J. Comput. Biol., 2013

2012

Finding a Periodic Attractor of a Boolean Network.

Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura

IEEE ACM Trans. Comput. Biol. Bioinform., 2012

GO for Integration of Expression Data.

Dikla Dotan-Cohen, Dana Moonshine, Moshe Natan, Yonat Shemer-Avni, Avraham A. Melkman

Silico Biol., 2012

Singleton and 2-periodic attractors of sign-definite Boolean networks.

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura

Inf. Process. Lett., 2012

2011

Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.

Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto

J. Comput. Biol., 2011

2010

Determining a singleton attractor of an AND/OR Boolean network in O(1.587ⁿ) time.

Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu

Inf. Process. Lett., 2010

2009

Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering.

Dikla Dotan-Cohen, Simon Kasif, Avraham A. Melkman

Bioinform., 2009

2007

Hierarchical tree snipping: clustering guided by prior knowledge.

Dikla Dotan-Cohen, Avraham A. Melkman, Simon Kasif

Bioinform., 2007

2006

A Compression-Boosting Transform for Two-Dimensional Data.

Qiaofeng Yang, Stefano Lonardi, Avraham A. Melkman

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2004

Sleeved coclustering.

Avraham A. Melkman, Eran Shaham

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

2001

Smooth and adaptive forward erasure correcting.

Shlomi Dolev, Boris Fitingof, Avraham A. Melkman, Olga Tubman

Comput. Networks, 2001

1997

A Note on Approximate Inclusion-exclusion.

Avraham A. Melkman, Solomon Eyal Shimony

Discret. Appl. Math., 1997

1996

Algorithms for Parsimonious Complete Sets in Directed Graphs.

Avraham A. Melkman, Solomon Eyal Shimony

Inf. Process. Lett., 1996

1995

A comparison of display methods for spatial point layout.

David Leiser, Yoella Bereby, Avraham A. Melkman

Behav. Inf. Technol., 1995

1987

On-Line Construction of the Convex Hull of a Simple Polyline.

Avraham A. Melkman

Inf. Process. Lett., 1987

1978

On an inverse for sections of a binomial matrix.

Ian F. Blake, Avraham A. Melkman

Discret. Math., 1978