Sciweavers

350 search results - page 42 / 70
» Probabilistic question answering on the web
Sort
View
CJ
2002
67views more  CJ 2002»
13 years 7 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
SEMWEB
2004
Springer
14 years 1 months ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
SCCC
1997
IEEE
13 years 12 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
IUI
2003
ACM
14 years 29 days ago
Towards a theory of natural language interfaces to databases
The need for Natural Language Interfaces to databases (NLIs) has become increasingly acute as more and more people access information through their web browsers, PDAs, and cell ph...
Ana-Maria Popescu, Oren Etzioni, Henry A. Kautz
BMCBI
2007
153views more  BMCBI 2007»
13 years 7 months ago
Estimating genealogies from linked marker data: a Bayesian approach
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
Dario Gasbarra, Matti Pirinen, Mikko J. Sillanp&au...