Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Rahman, MohammadSohel
Bangladesh University of Engineering and Technology (BUET)
Dhaka, Bangladesh
   Reviewer Selected
Follow this Reviewer
Date Reviewed  
- 10 of 12 reviews

  Path-based methods on categorical structures for conceptual representation of Wikipedia articles
Kucharczyk Ł., Szymański J.  Journal of Intelligent Information Systems 48(2): 309-327, 2017. Type: Article

The task of determining whether two documents cover similar topics pops up in many different contexts. This requires solving two different subtasks, namely, extraction of significant and useful characteristics/features from the document and applic...

Nov 3 2017  
  Graph isomorphism in quasipolynomial time [extended abstract]
Babai L.  STOC 2016 (Proceedings of the 48th Annual ACM SIGACT Symposium on the Theory of Computing, Cambridge, MA,  Jun 19-21, 2016) 684-697, 2016. Type: Proceedings

The graph isomorphism (GI) problem is an extremely interesting problem for computer scientists and mathematicians alike, and it is one of those problems whose complexity status is still unresolved. To this end, in this paper, Babai presents a brea...

Jun 27 2017  
   Support vector machines and perceptrons: learning, optimization, classification, and application to social networks
Murty M., Raghava R.,  Springer International Publishing, New York, NY, 2016. 95 pp. Type: Book (978-3-319410-62-3)

In the preface of the book, the authors boldly state: “SVMs [support vector machines] have revolutionized the research in the areas of machine learning and pattern recognition, specifically classification, so much that for a period of more t...

Apr 11 2017  
  Improved algorithms for constructing consensus trees
Jansson J., Shen C., Sung W.  Journal of the ACM 63(3): 1-24, 2016. Type: Article

A phylogenetic tree is a popular structure used by both biologists and computer scientists to infer evolutionary relationships among various species. In spite of its popularity, different methods, datasets, heuristics and so on used to generate th...

Feb 8 2017  
   Computing equality-free and repetitive string factorisations
Schmid M.  Theoretical Computer Science 61842-51, 2016. Type: Article

String factorization has long been at the heart of research on the combinatorics of words. It has attracted researchers from both theory and practice because not only is it inherently beautiful as a theoretical problem, but it has a lot of promisi...

Sep 1 2016  
  Faster compressed suffix trees for repetitive collections
Navarro G., Ordóñez Pereira A.  Journal of Experimental Algorithmics 21(1): 1-38, 2016. Type: Article

The suffix tree is a celebrated data structure in stringology and is used in providing efficient solutions for a plethora of problems. The main problem of suffix trees is their space usage: they may even require 20 bytes per text symbol! One solut...

May 9 2016  
  Improved parameterized and exact algorithms for cut problems on trees
Kanj I., Lin G., Liu T., Tong W., Xia G., Xu J., Yang B., Zhang F., Zhang P., Zhu B.  Theoretical Computer Science 607, Part 3, 455-470, 2015. Type: Article

Multicut and multiway cut problems on graphs have received significant attention in the literature. Both of the problems are hard and have interesting applications. The authors of this paper study variants of the above problems. In particular, the...

Mar 8 2016  
  Sorting and selection with imprecise comparisons
Ajtai M., Feldman V., Hassidim A., Nelson J.  ACM Transactions on Algorithms 12(2): 1-19, 2015. Type: Article

Sorting and selection with imprecise comparisons has long been the focus of extensive research attention among theoreticians. There have been a number of models and frameworks of imprecision considered in the literature. In this paper, the authors...

Feb 1 2016  
  Mining high utility itemsets by dynamically pruning the tree structure
Song W., Liu Y., Li J.  Applied Intelligence 40(1): 29-43, 2014. Type: Article

Utility mining is one of the most important and contemporary research topics in data mining. It addresses the limitation of frequent itemset mining by considering nonbinary frequency values of items in transactions and different profit values for ...

Oct 9 2015  
  Core words and Parikh matrices
Teh W., Kwa K.  Theoretical Computer Science 582(C): 60-69, 2015. Type: Article

Parikh matrices have been widely used and researched as a tool for studying numerical properties of words since their introduction by Mateescu et al. [1]. Related notions like M-equivalence, M-unambiguity, and...

Aug 31 2015  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy