Sciweavers

15 search results - page 1 / 3
» Fundamental Properties of the Core Matching Functions for In...
Sort
View
FLAIRS
2000
13 years 5 months ago
Fundamental Properties of the Core Matching Functions for Information Retrieval
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
Dawei Song, Kam-Fai Wong, Peter Bruza, Chun Hung C...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 5 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
SIGIR
2006
ACM
13 years 9 months ago
Theoretical benchmarks of XML retrieval
This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML r...
Tobias Blanke, Mounia Lalmas
IRI
2009
IEEE
13 years 10 months ago
OntoMatch: A Monotonically Improving Schema Matching System for Autonomous Data Integration
Traditional schema matchers use a set of distinct simple matchers and use a composition function to combine the individual scores using an arbitrary order of matcher application l...
Anupam Bhattacharjee, Hasan M. Jamil
FOSAD
2007
Springer
13 years 9 months ago
Secure Service Orchestration
Abstract. We present a framework for designing and composing services in a secure manner. Services can enforce security policies locally, and can invoke other services in a “call...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...