25 search results - page 5 / 5 » Formalizing the XML Schema Matching Problem as a Constraint ... |
SIGECOM
2006
ACM
13 years 10 months ago
2006
ACM
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
RECOMB
1998
Springer
13 years 9 months ago
1998
Springer
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
PVLDB
2010
13 years 3 months ago
2010
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
KDD
2005
ACM
14 years 5 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...