Sciweavers

5 search results - page 1 / 1
» Feasibility of Optimised Disjunctive Reasoning for Approxima...
Sort
View
AUSAI
1999
Springer
13 years 8 months ago
Feasibility of Optimised Disjunctive Reasoning for Approximate Matching
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
Ian Horrocks, Lin Padgham, Laura Thomson
SAC
2009
ACM
13 years 10 months ago
Efficient mobile reasoning for pervasive discovery
Semantic service discovery architectures that operate in mobile environments must cope with the significant challenges of finding relevant services rapidly, while facing constrain...
Luke Steller, Shonali Krishnaswamy
DLOG
2007
13 years 6 months ago
Speeding up Approximation with Nicer Concepts
Abstract. Concept approximation is an inference service for Description Logics that provides “translations” of concept descriptions from one DL to a less expressive DL. In [4] ...
Anni-Yasmin Turhan, Yusri Bong
VLDB
2005
ACM
93views Database» more  VLDB 2005»
13 years 9 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
BMCBI
2008
123views more  BMCBI 2008»
13 years 3 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