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
Albeanu, Grigore
Spiru Haret University
Bucharest, Romania
   Featured Reviewer
   Reader Recommended
   Reviewer Selected
Follow this Reviewer

Grigore Albeanu is a professor of computer science at Spiru Haret University in Bucharest, Romania. He received his PhD in mathematics, in 1996, from the University of Bucharest.

Grigore has also worked as a software analyst and developer for the Forest Research and Management Institute (1984-1986, and the Institute of Scientific Research and Technological Engineering for Computing and Informatics (1986-1991, He was an associate professor at Bucharest University until 2002, and served as the head of the UNESCO Chair in Information Technologies at the University of Oradea (2004-2007).

As principal investigator in a North Atlantic Treaty Organization (NATO) project, Grigore collaborated with colleagues from all over the world on many scientific projects, including PhD theses and national and international competitions, as well as consultancy for small and medium enterprises.

His current research interests are different aspects of computing systems, modeling and simulation, software reliability, virtual reality techniques, fog computing, smart technologies, and scientific computing, including computational intelligence, numerical methods, and machine learning.

Grigore has authored (or coauthored) over 120 papers and ten textbooks in applied mathematics and computer science. He is an active referee or editor for many journals and conferences, and has been a reviewer for Computing Reviews since 1988.

Date Reviewed  
- 10 of 78 reviews

  Efficient differentiable programming in a functional array-processing language
Shaikhha A., Fitzgibbon A., Vytiniotis D., Peyton Jones S.  Proceedings of the ACM on Programming Languages 3(ICFP): 1-30, 2019. Type: Article

Differentiable programming, or automatic differentiation, is a powerful technique in many fields, including dynamic systems, machine learning, and computer vision, mainly for solving nonlinear problems. Forward (versus reverse) differentiation bas...

Jul 20 2021  
  Simplicity is best: addressing the computational cost of machine learning classifiers in constrained edge devices
Gómez-Carmona O., Casado-Mansilla D., López-de-Ipiña D., García-Zubia J.  IoT 2019 (Proceedings of the 9th International Conference on the Internet of Things, Bilbao, Spain,  Oct 22-25, 2019) 1-8, 2019. Type: Proceedings

Implementing data processing toward the edge of the Internet of Things (IoT) is an important requirement in order to produce real-time feedback according to some decision-based approach....

Jul 7 2021  
  Access controls and healthcare records: who owns the data?
CACM Staff .  Communications of the ACM 62(7): 41-46, 2019. Type: Article

In this article, three distinguished scientists (David Evans, Richard McDonald, and Terry Coatta) debate on the most recent and challenging approaches concerning healthcare records: ownership, privacy, security, and modern medical information syst...

Aug 30 2019  
  A tutorial on canonical correlation methods
Uurtio V., Monteiro J., Kandola J., Shawe-Taylor J., Fernandez-Reyes D., Rousu J.  ACM Computing Surveys 50(6): 1-33, 2018. Type: Article

Canonical correlation analysis (CCA) is used to discover relations between two or more multivariate sets of variables, called views. Data to be processed are collected for a population of individuals, and for one individual its state is described ...

Apr 26 2018  
  Scalable density-based clustering with quality guarantees using random projections
Schneider J., Vlachos M.  Data Mining and Knowledge Discovery 31(4): 972-1005, 2017. Type: Article

Efficient clustering techniques are required for knowledge discovery in large databases. The efforts of scientists have contributed to the development of many clustering algorithms....

Oct 30 2017  
   Dempster’s rule of combination
Shafer G.  International Journal of Approximate Reasoning 7926-40, 2016. Type: Article

The rule of combination of belief functions on infinite sets of possibilities is developed in this paper. The author continues his developments on Dempster’s theory on lower probabilities in order to generalize already-obtained results in th...

Feb 22 2017  
  A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Halman N.  Theoretical Computer Science 645(C): 41-47, 2016. Type: Article

The knapsack problem (KP) appears in many forms in science, economics, and engineering. The classical formulation uses a set of items, each with a weight and a value, and asks to determine the number of each item to include in a knapsack so that t...

Jan 16 2017  
   Information modelling and knowledge bases XXV
Tokuda T., Kiyoki Y., Jaakkola H., Yoshida N.,  IOS Press, Amsterdam, the Netherlands, 2014. 336 pp. Type: Book (978-1-614993-60-5)

The growing complexity of modern society has required the development of models and algorithms for knowledge management. In this book, the reader will find 22 selected papers on various related topics. Many subjects are covered, but the main strea...

Feb 18 2015  
  On the Newton bivariate polynomial interpolation with applications
Varsamis D., Karampetakis N.  Multidimensional Systems and Signal Processing 25(1): 179-209, 2014. Type: Article

Readers interested in numerical methods and systems theory will find a significant contribution to bivariate interpolation in this paper....

Jun 13 2014  
   Computing with real numbers, from Archimedes to Turing and beyond
Braverman M.  Communications of the ACM 56(9): 74-83, 2013. Type: Article

Under a concise and a very attractive title, the author invites the reader to a beautiful journey over the computability field....

Jan 28 2014  
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