Avraham A. Melkman

29 papers A* 1B 1C 1Journal 24Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Size and Width of the Decoder of a Boolean Threshold Autoencoder.
IEEE Trans. Neural Networks Learn. Syst.
Tatsuya Akutsu, Avraham A. Melkman
2025 — conf
Shortest Longest-Path Graph Orientations for Trees.
SOFSEM (1)
Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Yoshichika Yano, Shay Zakov
2023 J jnl
On the Compressive Power of Boolean Threshold Autoencoders.
IEEE Trans. Neural Networks Learn. Syst.
Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu
2023 J jnl
On the Trade-off between the Number of Nodes and the Number of Trees in a Random Forest.
CoRR
Tatsuya Akutsu, Avraham A. Melkman, Atsuhiro Takasu
2023 — conf
Shortest Longest-Path Graph Orientations.
COCOON (1)
Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov
2021 J jnl
On the Size and Width of the Decoder of a Boolean Threshold Autoencoder.
CoRR
Tatsuya Akutsu, Avraham A. Melkman
2020 J jnl
Extracting boolean and probabilistic rules from trained neural networks.
Neural Networks
Pengyu Liu, Avraham A. Melkman, Tatsuya Akutsu
2020 J jnl
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree.
Int. J. Found. Comput. Sci.
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura
2020 J jnl
On the Compressive Power of Boolean Threshold Autoencoders.
CoRR
Avraham A. Melkman, Sini Guo, Wai-Ki Ching, Pengyu Liu, Tatsuya Akutsu
2019 J jnl
Identification of the Structure of a Probabilistic Boolean Network From Samples Including Frequencies of Outcomes.
IEEE Trans. Neural Networks Learn. Syst.
Tatsuya Akutsu, Avraham A. Melkman
2018 J jnl
Identifying a Probabilistic Boolean Threshold Network From Samples.
IEEE Trans. Neural Networks Learn. Syst.
Avraham A. Melkman, Xiaoqing Cheng, Wai-Ki Ching, Tatsuya Akutsu
2015 J jnl
On the complexity of finding a largest common subtree of bounded degree.
Theor. Comput. Sci.
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
2013 J jnl
An Improved Satisfiability Algorithm for Nested Canalyzing Functions and its Application to Determining a Singleton Attractor of a Boolean Network.
J. Comput. Biol.
Avraham A. Melkman, Tatsuya Akutsu
2013 B conf
On the Complexity of Finding a Largest Common Subtree of Bounded Degree.
FCT
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu
2012 J jnl
Finding a Periodic Attractor of a Boolean Network.
IEEE ACM Trans. Comput. Biol. Bioinform.
Tatsuya Akutsu, Sven Kosub, Avraham A. Melkman, Takeyuki Tamura
2012 J jnl
GO for Integration of Expression Data.
Silico Biol.
Dikla Dotan-Cohen, Dana Moonshine, Moshe Natan, Yonat Shemer-Avni, Avraham A. Melkman
2012 J jnl
Singleton and 2-periodic attractors of sign-definite Boolean networks.
Inf. Process. Lett.
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura
2011 J jnl
Determining a Singleton Attractor of a Boolean Network with Nested Canalyzing Functions.
J. Comput. Biol.
Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura, Masaki Yamamoto
2010 J jnl
Determining a singleton attractor of an AND/OR Boolean network in O(1.587
Inf. Process. Lett.
Avraham A. Melkman, Takeyuki Tamura, Tatsuya Akutsu
2009 J jnl
Seeing the forest for the trees: using the Gene Ontology to restructure hierarchical clustering.
Bioinform.
Dikla Dotan-Cohen, Simon Kasif, Avraham A. Melkman
2007 J jnl
Hierarchical tree snipping: clustering guided by prior knowledge.
Bioinform.
Dikla Dotan-Cohen, Avraham A. Melkman, Simon Kasif
2006 C conf
A Compression-Boosting Transform for Two-Dimensional Data.
AAIM
Qiaofeng Yang, Stefano Lonardi, Avraham A. Melkman
2004 A* conf
Sleeved coclustering.
KDD
Avraham A. Melkman, Eran Shaham
2001 J jnl
Smooth and adaptive forward erasure correcting.
Comput. Networks
Shlomi Dolev, Boris Fitingof, Avraham A. Melkman, Olga Tubman
1997 J jnl
A Note on Approximate Inclusion-exclusion.
Discret. Appl. Math.
Avraham A. Melkman, Solomon Eyal Shimony
1996 J jnl
Algorithms for Parsimonious Complete Sets in Directed Graphs.
Inf. Process. Lett.
Avraham A. Melkman, Solomon Eyal Shimony
1995 J jnl
A comparison of display methods for spatial point layout.
Behav. Inf. Technol.
David Leiser, Yoella Bereby, Avraham A. Melkman
1987 J jnl
On-Line Construction of the Convex Hull of a Simple Polyline.
Inf. Process. Lett.
Avraham A. Melkman
1978 J jnl
On an inverse for sections of a binomial matrix.
Discret. Math.
Ian F. Blake, Avraham A. Melkman