Trevor I. Fenner

Comput. Intell., June, 2023

2022

Modeling Generalization in Domain Taxonomies Using a Maximum Likelihood Criterion.

[BibT_eX]

[DOI]

Proceedings of the Information Systems and Technologies, 2022

SCAIL: Encrypted Deduplication With Segment Chunks and Index Locality.

[BibT_eX]

[DOI]

Jaybe Ammons

David Weston

Proceedings of the IEEE International Conference on Networking, Architecture and Storage, 2022

2021

Fast Generation of Unlabelled Free Trees using Weight Sequences.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

2020

A two-dimensional bibliometric index reflecting both quality and quantity.

[BibT_eX]

[DOI]

Martyn Harris

Scientometrics, 2020

Parsimonious generalization of fuzzy thematic sets in taxonomies applied to the analysis of tendencies of research in data science.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Supercards, Sunshines and Caterpillar Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

A Hybrid Approach to Interpretable Analysis of Research Paper Collections.

[BibT_eX]

[DOI]

Proceedings of the WIMS 2020: The 10th International Conference on Web Intelligence, Mining and Semantics, Biarritz, France, June 30, 2020

A Hybrid Approach to the Analysis of a Collection of Research Papers.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2020, 2020

2019

Characterisation of the $$\chi$$ χ -index and the rec-index.

[BibT_eX]

[DOI]

Judit Bar-Ilan

Scientometrics, 2019

Human dynamics with limited complexity.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2019

Characterisation of the χ-index and the rec-index.

[BibT_eX]

[DOI]

Judit Bar-Ilan

CoRR, 2019

Distance and Consensus for Preference Relations Corresponding to Ordered Partitions.

[BibT_eX]

[DOI]

Boris G. Mirkin

J. Classif., 2019

Globally Optimal Parsimoniously Lifting a Fuzzy Query Set Over a Taxonomy Tree.

[BibT_eX]

[DOI]

Proceedings of the Optimization of Complex Systems: Theory, 2019

Computational Generalization in Taxonomies Applied to: (1) Analyze Tendencies of Research and (2) Extend User Audiences.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Data Engineering and Automated Learning - IDEAL 2019, 2019

Method for Generalization of Fuzzy Sets.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Soft Computing, 2019

Using Taxonomy Tree to Generalize a Fuzzy Thematic Cluster.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

2018

The size of a graph is reconstructible from any n-2 cards.

[BibT_eX]

[DOI]

Discret. Math., 2018

2016

Min-Sum 2-Paths Problems.

[BibT_eX]

[DOI]

Oded Lachish

Alexandru Popa

Theory Comput. Syst., 2016

2015

A stochastic evolutionary model generating a mixture of exponential distributions.

[BibT_eX]

[DOI]

CoRR, 2015

2013

A bibliometric index based on the complete list of cited publications

[BibT_eX]

[DOI]

Judit Bar-Ilan

CoRR, 2013

Analysis of Cluster Structure in Large-Scale English Wikipedia Category Networks.

[BibT_eX]

[DOI]

Panagiotis Papapetrou

Proceedings of the Advances in Intelligent Data Analysis XII, 2013

2012

A Discrete Evolutionary Model for Chess Players' Ratings.

[BibT_eX]

[DOI]

Renato Cordeiro de Amorim

IEEE Trans. Comput. Intell. AI Games, 2012

Weighting Features for Partition around Medoids Using the Minkowski Metric.

[BibT_eX]

[DOI]

Proceedings of the Advances in Intelligent Data Analysis XI - 11th International Symposium, 2012

2011

Recognizing connectedness from vertex-deleted subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

A methodology for learning players' styles from game records.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Soft Comput., 2011

How to Visualize a Crisp or Fuzzy Topic Set over a Taxonomy.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition and Machine Intelligence, 2011

2010

Families of pairs of graphs with a large number of common cards.

[BibT_eX]

[DOI]

Andrew Bowler

J. Graph Theory, 2010

Building Fuzzy Thematic Clusters and Mapping Them to Higher Ranks in a Taxonomy.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2010

Constructing and Mapping Fuzzy Thematic Clusters to Higher Ranks in a Taxonomy.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, 2010

A Hybrid Cluster-Lift Method for the Analysis of Research Activities.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Artificial Intelligence Systems, 5th International Conference, 2010

2008

Modelling the navigation potential of a web page.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Move Generation with Perfect Hash Functions.

[BibT_eX]

J. Int. Comput. Games Assoc., 2008

2007

A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff.

[BibT_eX]

[DOI]

Soc. Networks, 2007

A stochastic evolutionary growth model for social networks.

[BibT_eX]

[DOI]

Comput. Networks, 2007

2006

A stochastic model for the evolution of the Web allowing link deletion.

[BibT_eX]

[DOI]

ACM Trans. Internet Techn., 2006

Aggregating Homologous Protein Families in Evolutionary Reconstructions of Herpesviruses.

[BibT_eX]

[DOI]

Boris G. Mirkin

Renata da Silva Camargo

Paul Kellam

Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

2005

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.

[BibT_eX]

[DOI]

Abraham Flaxman

Internet Math., 2005

2002

A stochastic model for the evolution of the Web.

[BibT_eX]

[DOI]

Comput. Networks, 2002

2001

The effect of mobility on minimaxing of game trees with random leaf values.

[BibT_eX]

[DOI]

Artif. Intell., 2001

2000

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least <i>k</i>.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

On the expressive power of the relational algebra with partially ordered domains.

[BibT_eX]

[DOI]

Wilfred Ng

Int. J. Comput. Math., 2000

1996

On the Best Case of Heapsort.

[BibT_eX]

[DOI]

Béla Bollobás

J. Algorithms, 1996

1995

On Key Storage in Secure Networks.

[BibT_eX]

[DOI]

J. Cryptol., 1995

A Partial Analysis of Minimaxing Game Trees with Random Leaf Values.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1995

1987

An algorithm for finding Hamilton cycles in a random graph.

[BibT_eX]

[DOI]

Béla Bollobás

Comb., 1987

1985

An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements.

[BibT_eX]

[DOI]

BIT, 1985

1984

Hamiltonian cycles in random regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

Loop-Free Algorithms for Traversing Binary Trees.

[BibT_eX]

[DOI]

BIT, 1984

1983

Tree Traversal Related Algorithms for Generating Integer Partitions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

On the existence of Hamiltonian cycles in a class of random graphs.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

On the connectivity of random m-orientable graphs and digraphs.

[BibT_eX]

[DOI]

Comb., 1982

1981

A Note on Traversal Algorithms for Triply Linked Binary Trees.

[BibT_eX]

[DOI]

BIT, 1981

An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions.

[BibT_eX]

[DOI]

Acta Informatica, 1981

1980

A Binary Tree Representation and Related Algorithms for Generating Partitions.

[BibT_eX]

[DOI]

Comput. J., 1980

1978

Some Results on Condition Numbers and Matrix Scaling.

[BibT_eX]

[DOI]

PhD thesis, 1978

1977

Combinatorial aspects of rectangular non-negative matrices.

[BibT_eX]

[DOI]

Georghios Loizou

Discret. Math., 1977

1974

Some New Bounds on the Condition Numbers of Optimally Scaled Matrices.

[BibT_eX]

[DOI]

J. ACM, 1974

1973

QUEST: the design of a very high level, pedagogic programming language.

[BibT_eX]

[DOI]

Michael A. Jenkins

Robert D. Tennent

ACM SIGPLAN Notices, 1973

1971

On Fully Indecomposable Matrices.

[BibT_eX]

[DOI]