Sciweavers

2145 search results - page 185 / 429
» Pattern-Based Query Answering
Sort
View
UAI
2003
15 years 3 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
100
Voted
ECAI
2006
Springer
15 years 6 months ago
Formalizing Complex Task Libraries in Golog
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
Alfredo Gabaldon
125
Voted
AAAI
2006
15 years 4 months ago
An Investigation into the Feasibility of the Semantic Web
This report is an expanded version of a paper in AAAI-2006 proceedings. In this report, we investigate the challenges that must be addressed for the Semantic Web to become a feasi...
Zhengxiang Pan, Abir Qasem, Jeff Heflin
148
Voted
WEBI
2010
Springer
15 years 12 days ago
Using Relational Similarity between Word Pairs for Latent Relational Search on the Web
Latent relational search is a new search paradigm based on the degree of analogy between two word pairs. A latent relational search engine is expected to return the word Paris as a...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
134
Voted
ACSC
2004
IEEE
15 years 6 months ago
Web Mining in Search Engines
Given the rate of growth of the Web, scalability of search engines is a key issue, as the amount of hardware and network resources needed is large, and expensive. In addition, sea...
Ricardo A. Baeza-Yates