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
  Fagin, Ronald Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  Query strategies for priced information: an experiment with the shortest-paths algorithms
Charikar M., Fagin R., Guruswami V., Kleinberg J., Raghavan P., Sahai A. Journal of Computer and System Sciences 64(4): 785-819, 2002.  Type: Article

In this paper, lowest cost algorithms are described for finding the value of a Boolean function by sequentially assigning values to variables, in the case when each input variable has an associated price. A corresponding situation is w...
...
Jul 24 2003  
  Reasoning about knowledge and probability
Fagin R., Halpern J. Journal of the ACM 41(2): 340-367, 1994.  Type: Article

The way toward a model for reasoning about knowledge and probability begins in this paper with a review of classical possible-worlds semantics for knowledge. Next, the authors provide an extended language and a complete axiomatization ...
...
Mar 1 1995  
  Simple conditions for guaranteeing higher normal forms in relational databases
Date C., Fagin R. ACM Transactions on Database Systems 17(3): 465-476, 1992.  Type: Article

The hierarchy of normal forms for schema design by decomposition using only projection and join was completed by Fagin in 1979 with his description of projection-join normal form (PJ/NF, also called 5NF) [1]. More than a decade later, ...
...
Jun 1 1993  

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