Sciweavers

11862 search results - page 25 / 2373
» Relative information completeness
Sort
View
AAAI
1996
13 years 9 months ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld
ECIR
2009
Springer
14 years 4 months ago
A Topic-Based Measure of Resource Description Quality for Distributed Information Retrieval
The aim of query-based sampling is to obtain a sufficient, representative sample of an underlying (text) collection. Current measures for assessing sample quality are too coarse gr...
Mark Baillie, Mark James Carman, Fabio Crestani
HICSS
2006
IEEE
77views Biometrics» more  HICSS 2006»
14 years 1 months ago
Using Social Contextual Information to Match Criminal Identities
Criminal identity matching is crucial to crime investigation in law enforcement agencies. Existing techniques match identities that refer to the same individuals based on simple i...
G. Alan Wang, Jennifer Jie Xu, Hsinchun Chen
ICGI
2004
Springer
14 years 29 days ago
Learning Node Selecting Tree Transducer from Completely Annotated Examples
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
Julien Carme, Aurélien Lemay, Joachim Niehr...
DEXA
2009
Springer
109views Database» more  DEXA 2009»
14 years 2 months ago
Inclusion Dependencies in XML: Extending Relational Semantics
In this article we define a new type of integrity constraint in XML, called an XML inclusion constraint (XIND), and show that it extends the semantics of a relational inclusion de...
Michael Karlinger, Millist W. Vincent, Michael Sch...