Computationally tractable probabilistic modeling of Boolean operators

Abstract

article Free Access Share on Computationally tractable probabilistic modeling of Boolean operators Authors: Warren R. Greiff Computer Science Department, University of Masaachusetts, Amherst, Amherst, Massachusetts Computer Science Department, University of Masaachusetts, Amherst, Amherst, MassachusettsView Profile , W. Bruce Croft Computer Science Department, University of Masaachusetts, Amherst, Amherst, Massachusetts Computer Science Department, University of Masaachusetts, Amherst, Amherst, MassachusettsView Profile , Howard Turtle West Publishing Co., Eagan, Minnesota West Publishing Co., Eagan, MinnesotaView Profile Authors Info & Claims ACM SIGIR ForumVolume 31Issue SIDecember 1997 pp 119–128https://doi.org/10.1145/278459.258547Published:01 July 1997Publication History 4citation480DownloadsMetricsTotal Citations4Total Downloads480Last 12 Months23Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF