Sciweavers

387 search results - page 20 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGIR
2012
ACM
11 years 11 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
DLOG
2011
13 years 5 days ago
Status QIO: An Update
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
Birte Glimm, Yevgeny Kazakov, Carsten Lutz
JAIR
2002
101views more  JAIR 2002»
13 years 8 months ago
Structured Knowledge Representation for Image Retrieval
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
Eugenio Di Sciascio, Francesco M. Donini, Marina M...
BMCBI
2008
123views more  BMCBI 2008»
13 years 8 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
CVPR
2005
IEEE
14 years 2 months ago
Symmetric Stereo Matching for Occlusion Handling
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
Jian Sun, Yin Li, Sing Bing Kang