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
Krishnamoorthy, Mukkai
Troy, New York
   Reviewer Selected
Follow this Reviewer
Date Reviewed  
- 10 of 28 reviews

   Mining imperfect data: with examples in R and Python (2nd ed.)
Pearson R.,  SIAM, Philadelphia, PA, 2020. 184 pp. Type: Book (978-1-611976-26-7)

Data analysis--including both data mining and machine learning--has made a lot of progress in the past decade. Both the R and Python programming languages have been used to analyze data. The Achilles’ heel in this task is the handl...

Nov 19 2021  
   Digital cash: the unknown history of the anarchists, utopians, and technologists who created cryptocurrency
Brunton F.,  PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2019. 272 pp. Type: Book (978-0-691179-49-0)

This comprehensive book covers the history of digital cash/currency, including the current era of Bitcoin and blockchain technology. The author argues that digital cash is to be understood in terms of authentication, ownership, and certainty and p...

Feb 10 2020  
   Nature-inspired optimization algorithms
Yang X.,  ELSEVIER, Waltham, MA, 2014. 300 pp. Type: Book (978-0-124167-43-8)

Solving optimization problems has been the bane of scientific and combinatorial computing. Even though polynomial-time algorithms exist for some problems such as linear programming, matching, and network flow, most problems are intractable (or NP-...

Jan 13 2015  
   Big data integration theory: theory and methods of database mappings, programming languages, and semantics
Majkić Z.,  Springer Publishing Company, Incorporated, New York, NY, 2014. 473 pp. Type: Book (978-3-319041-55-1), Reviews: (1 of 2)

As the title of the book rightly states, the contents have more to do with data integration theory and categorical logical theories than big data. The adjective “big” is added to make this book topical, but it is all about theory and t...

Sep 5 2014  
  Efficient matching for column intersection graphs
Auer B., Bisseling R.  Journal of Experimental Algorithmics 191.1-1.22, 2014. Type: Article

Graph partitioning and hypergraph partitioning have been used extensively in applications ranging from very-large-scale integration (VLSI) to portioning of data in parallel and distributed applications. Hypergraph and graph partitioning problems a...

Jul 30 2014  
   Algorithmic trading review
Treleaven P., Galas M., Lalchand V.  Communications of the ACM 56(11): 76-85, 2013. Type: Article

Three researchers from University College of London, who have spent eight years developing algorithmic trading (AT) systems and an algorithmic trading/risk platform, have written a fascinating review article on AT. Algorithmic trading refers to an...

Apr 9 2014  
  Improving multiple aesthetics produces better graph drawings
Huang W., Eades P., Hong S., Lin C.  Journal of Visual Languages and Computing 24(4): 262-272, 2013. Type: Article

Since many aesthetic constraints are conflicting in nature, graph-drawing algorithms generally tend to optimize one or two constraints to the fullest. This paper introduces a new graph-drawing algorithm called BIGANGLE, which is built on the class...

Nov 20 2013  
  Algorithm 928: a general, parallel implementation of Dantzig-Wolfe decomposition
Rios J.  ACM Transactions on Mathematical Software 39(3): 1-10, 2013. Type: Article

An open-source implementation of the Dantzig-Wolfe decomposition method, a powerful and useful technique for solving linear programming problems of block-angular form, is described in this concise and well-written paper....

Jul 5 2013  
  Building theories of economic process
Shubik M., Smith E.  Complexity 14(3): 77-92, 2009. Type: Article

The importance of the structure of physical processes to economic phenomena is emphasized in this paper....

Jun 15 2009  
  Cleaning a network with brushes
Messinger M., Nowakowski R., Praat P.  Theoretical Computer Science 399(3): 191-205, 2008. Type: Article

This well-written paper has interesting initial results on cleaning a graph. The authors consider the following model for cleaning edges of a graph:...

Nov 20 2008  
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy