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
  Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Mathematical Logic (F.4.1) > Set Theory (F.4.1...)  
 
Options:
 
  1-10 of 44 Reviews about "Set Theory (F.4.1...)": Date Reviewed
  Reconsidering pairs and functions as sets
Brown C.  Journal of Automated Reasoning 55(3): 199-210, 2015. Type: Article

In set theory, a pair (x,y) is normally described using Kuratowski’s representation {{x},{x,y}}. The set of all the pairs (x,
Dec 8 2015
  Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate
Cantone D., Ursino P.  Information and Computation 237215-242, 2014. Type: Article

In an effort to marry set theory and theoretical computer science, in 1970 the Computable Set Theory project was launched to study decidable fragments of set theory. A challenging question for researchers has been finding a way to overcome the imp...

May 27 2015
  Mathematical tools for data mining: set theory, partial orders, combinatorics (2nd ed.)
Simovici D., Djeraba C.,  Springer Publishing Company, Incorporated, London, UK, 2014. 831 pp. Type: Book (978-1-447164-06-7)

The goal of this book is to present the basic mathematical theory and principles used in data mining tools and techniques. Accordingly, a variety of foundational theoretical concepts are covered, including set theory, combinatorics, linear algebra...

Sep 18 2014
  Ernst Zermelo: collected works: calculus of variations, applied mathematics, and physics (vol. 2)
Zermelo E., Ebbinghaus H. (ed), Kanamori A. (ed),  Springer Publishing Company, Incorporated, Berlin, Germany, 2013. 800 pp. Type: Book (978-3-540708-55-1)

Ernst Zermelo is mostly known for his contributions to pure mathematics, particularly to the foundations of set theory, with the axiom of choice, together with Abraham Fraenkel. Such work is displayed in Volume 1 [1]. However, Zermelo also contrib...

Jun 24 2014
  On (k, n)*-visual cryptography scheme
Arumugam S., Lakshmanan R., Nagar A.  Designs, Codes and Cryptography 71(1): 153-162, 2014. Type: Article

Imagine you have several transparencies and they all have black and white regions or pixels. Each one of them may not show anything in particular, but stacked up, an image may be revealed. This is the gist of a visual cryptography scheme (VCS). In...

Jun 5 2014
  Rough sets and intelligent systems--Professor Zdzislaw Pawlak in memoriam (Vol. 1)
Skowron A., Suraj Z.,  Springer Publishing Company, Incorporated, New York, NY, 2013. 704 pp. Type: Book (978-3-642303-43-2)

This is the first volume of a two-volume set of papers dedicated to the memory of Zdzislaw Pawlak. The second volume was previously reviewed in Computing Reviews [1]. There are 24 papers in this volume, three of which emphasize the scientif...

Aug 6 2013
  Vague C-means clustering algorithm
Xu C., Zhang P., Li B., Wu D., Fan H.  Pattern Recognition Letters 34(5): 505-510, 2013. Type: Article

Clustering data into fuzzy or vague categories is an essential task for data mining and information retrieval applications. In this paper, the authors propose adapting the classical fuzzy C-means (FCM) algorithm to vague sets, an extension of fuzz...

Jun 20 2013
  Generic subset ranking using binary classifiers
Sun Z., Jin W., Wang J.  Theoretical Computer Science 45689-99, 2012. Type: Article

Sun et al. study subset ranking using binary classifiers. They establish a reduction framework from subset ranking to binary classification, and establish new tight regret bounds extending and improving previous results. The paper shows that there...

Jan 17 2013
  Rough sets and intelligent systems - Professor Zdzisław Pawlak in memoriam (Vol. 2)
Skowron A., Suraj Z.,  Springer Publishing Company, Incorporated, New York, NY, 2012. 656 pp. Type: Book (978-3-642303-40-1)

Logical analysis requires precision in the definition and understanding of concepts and in the classification of data. However, many problems have inherently imprecise and vague components. For example, the fundamental concept of a set assumes tha...

Jan 14 2013
  The algebra of set functions I: the product theorem and duality
Lass B.  European Journal of Combinatorics 33(2): 227-236, 2012. Type: Article

This is the first of a sequence of research reports that attempt to approach the topic of the algebra of set functions in a complete way, and to illustrate its practicality in (re-)defining and (re-)proving results that we might have missed in the...

May 24 2012
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy