Sciweavers

387 search results - page 11 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SEMWEB
2009
Springer
14 years 3 months ago
KOSIMap: Ontology Alignments Results for OAEI 2009
Abstract. Ontology mapping has been recognised as an important approach to identifying similar information in heterogeneous ontologies. The Knowledge Organisation System Implicit M...
Quentin Reul, Jeff Z. Pan
DAC
2005
ACM
13 years 10 months ago
Piece-wise approximations of RLCK circuit responses using moment matching
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
Chirayu S. Amin, Yehea I. Ismail, Florentin Dartu
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 6 days ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
ICEIS
2009
IEEE
14 years 3 months ago
Relaxing XML Preference Queries for Cooperative Retrieval
Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been ...
SungRan Cho, Wolf-Tilo Balke
DEXA
2010
Springer
180views Database» more  DEXA 2010»
13 years 9 months ago
Approximate Instance Retrieval on Ontologies
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzl...