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
Search
 
Petrescu, Florian
Institute for Computers
Bucharest, Romania
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 11 reviews

   
  Computational methods of signal recovery and recognition
Mammone R., John Wiley & Sons, Inc., New York, NY, 1992.  Type: Book (9780471853848)

The basic purpose of this book is to introduce the computational methods of signal processing. The level of presentation makes it useful as a textbook for a graduate course in electrical engineering or computer science....

Oct 1 1995  
  A Renormalization Group Approach to Image Processing Problems
Gidas B. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(2): 164-180, 1989.  Type: Article

This remarkable paper deals with fundamental theoretical and practical aspects of image processing. The ideas behind renormalization groups were introduced in quantum electrodynamics, and the author’s scientific background in...

Jan 1 1990  
  An algorithm for multidimensional data clustering
Wan S., Wong S., Prusinkiewicz P. ACM Transactions on Mathematical Software 14(2): 153-162, 1988.  Type: Article

The authors introduce a new and promising multivariate data clustering algorithm. They adopt a divisive strategy, that is, a procedure that partitions the input data space sequentially into a number of disjoint subregions....

Dec 1 1989  
  An event-covering method for effective probabilistic inference
Wong A. (ed), Chiu D. Pattern Recognition 20(2): 245-255, 1987.  Type: Article

This paper provides an original tool for probabilistic inference. It is based on the measure of suprise and makes use of event-covering. The process of event-covering is said to be the finding of the interdependent relationships betwee...

Sep 1 1988  
  On the convergence of “A self-supervised vowel recognition system”
Pathak A., Pal S. Pattern Recognition 20(2): 237-244, 1987.  Type: Article

The authors prove the convergence of a self-supervised recognition algorithm that was reported a few years ago. The key concept related to this algorithm is represented by the guard zones, which are ellipsoidal regions around the refer...

Aug 1 1988  
  Labeled point pattern matching by Delaunay triangulation and maximal cliques
Ogawa H. Pattern Recognition 19(1): 35-40, 1986.  Type: Article

The paper provides a useful geometric pattern matching method, invariant under affine transformation, that allows for some random perturbations of the patterns. A pattern consists of a finite set of points characterized using spatial c...

Feb 1 1988  
  Heuristic approach to handwritten numeral recognition
Huang J., Chuang K. Pattern Recognition 19(1): 15-19, 1986.  Type: Article

The basic purpose of the authors is to develop a technique for recognizing “the worst written numerals, as humans can do so easily” rather than implementing an economic “numeral recognition system.R...

Sep 1 1987  
  Robust multiple-input matched filtering: frequency and time-domain results
Chen C., Kassam S. IEEE Transactions on Information Theory IT-31(6): 812-821, 1985.  Type: Article

This paper is dedicated to the study of the linear filters that maximize the output signal-to-noise ratio, known as matched filters. The authors introduce a robust matched filter, namely the filter that is optimum for a least-favorable...

Jun 1 1987  
  The family of one-counter languages is closed under quotient
Latteux M., Leguy B., Ratoandromanana B. Acta Informatica 22(5): 579-588, 1985.  Type: Article

This elegant and concise paper is dedicated to the study of closure properties of Rocl (the family of one-counter languages) under the operation of quotient. Rocl may be defined as the family of languages accepted by a pushdown automat...

Feb 1 1987  
  PETRIREVE: proving Petri net properties with rewriting systems
Choppy C., Johnen C.  Rewriting techniques and applications (, Dijon, France, 2861985.  Type: Proceedings

The basic idea of the paper consists of representing the behavior of Petri nets in terms of rewriting systems. Consequently, properties of Petri nets, such as boundedness, confluency, invariance, reachability, proper termination, and q...

Aug 1 1986  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy