Newsgroups: comp.ai.jair.announce
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!in1.uu.net!news.reference.com!cnn.nas.nasa.gov!eos!kronos.arc.nasa.gov!jair-ed
From: jair-ed@ptolemy.arc.nasa.gov
Subject: New Article, Logarithmic-Time Updates and Queries ...
Message-ID: <1996Mar1.012819.17419@ptolemy-ethernet.arc.nasa.gov>
Originator: jair-ed@polya.arc.nasa.gov
Lines: 40
Sender: usenet@ptolemy-ethernet.arc.nasa.gov (usenet@ptolemy.arc.nasa.gov)
Nntp-Posting-Host: polya.arc.nasa.gov
Organization: NASA/ARC Computational Sciences Division
Date: Fri, 1 Mar 1996 01:28:19 GMT
Approved: jair-ed@ptolemy.arc.nasa.gov

JAIR is pleased to announce the publication of the following article:

Delcher, A.L., Grove, A.J., Kasif, S. and Pearl, J. (1996)
  "Logarithmic-Time Updates and Queries in Probabilistic Networks", 
   Volume 4, pages 37-59.
   Available in PostScript (277K) and compressed Postscript (107K)
   Postscript file: delcher96a.ps
   For direct access with WWW browsers, use this URL:
    http://www.cs.washington.edu/research/jair/abstracts/delcher96a.html

   Abstract: Traditional databases commonly support efficient query and
   update procedures that operate in time which is sublinear in the size
   of the database.  Our goal in this paper is to take a first step
   toward dynamic reasoning in probabilistic databases with comparable
   efficiency.  We propose a dynamic data structure that supports
   efficient algorithms for updating and querying singly connected
   Bayesian networks.  In the conventional algorithm, new evidence is
   absorbed in O(1) time and queries are processed in time O(N), where N
   is the size of the network.  We propose an algorithm which, after a
   preprocessing phase, allows us to answer queries in time O(log N) at
   the expense of O(log N) time per evidence absorption.  The usefulness
   of sub-linear processing time manifests itself in applications
   requiring (near) real-time response over large probabilistic
   databases. We briefly discuss a potential application of dynamic
   probabilistic reasoning in computational biology.

The PostScript file is available via:
   
 -- comp.ai.jair.papers

 -- World Wide Web: The URL for our World Wide Web server is
       http://www.cs.washington.edu/research/jair/home.html

 -- Anonymous FTP from either of the two sites below:
      CMU:   p.gp.cs.cmu.edu        directory: /usr/jair/pub/volume4
      Genoa: ftp.mrg.dist.unige.it  directory:  pub/jair/pub/volume4

 -- automated email. Send mail to jair@cs.cmu.edu or jair@ftp.mrg.dist.unige.it
    with the subject AUTORESPOND, and the body GET VOLUME4/FILE-NM
    (e.g., GET VOLUME4/VANBEEK96A.PS)
    Note: Your mailer might find our files too large to handle. Also, note  
    that compressed files cannot be emailed, since they are binary files.

 -- JAIR Gopher server: At p.gp.cs.cmu.edu, port 70. 

For more information about JAIR, check out our WWW or FTP sites, or
send electronic mail to jair@cs.cmu.edu with the subject AUTORESPOND
and the message body HELP, or contact jair-ed@ptolemy.arc.nasa.gov.



