Sciweavers

2526 search results - page 24 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
14 years 9 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
DLOG
2003
13 years 10 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
ACL
2009
13 years 7 months ago
Answering Opinion Questions with Random Walks on Graphs
Opinion Question Answering (Opinion QA), which aims to find the authors' sentimental opinions on a specific target, is more challenging than traditional factbased question an...
Fangtao Li, Yang Tang, Minlie Huang, Xiaoyan Zhu
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 9 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 9 months ago
An Indirect Genetic Algorithm for Set Covering Problems
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
Uwe Aickelin