Sciweavers

387 search results - page 2 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SEMWEB
2007
Springer
13 years 11 months ago
Performance of Hybrid WSML Service Matching with WSMO-MX: Preliminary Results
Abstract. The WSMO-MX matchmaker applies different matching filters to retrieve WSMO-oriented service descriptions that are semantically relevant to a given query with respect to...
Frank Kaufer, Matthias Klusch
P2P
2006
IEEE
118views Communications» more  P2P 2006»
13 years 11 months ago
Conjunction Dysfunction: The Weakness of Conjunctive Queries in Peer-to-Peer File-sharing Systems
Peers in peer-to-peer file-sharing systems use conjunctive queries as a way of controlling query cost in the absence of information about the behavior of other peers. Conjunctive ...
Wai Gen Yee, Linh Thai Nguyen, Ophir Frieder
WWW
2008
ACM
14 years 5 months ago
Reasoning about similarity queries in text retrieval tasks
In many text retrieval tasks, it is highly desirable to obtain a "similarity profile" of the document collection for a given query. We propose sampling-based techniques ...
Xiaohui Yu, Yang Liu
CP
2009
Springer
13 years 11 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
AUSAI
1999
Springer
13 years 9 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