Sciweavers

387 search results - page 38 / 78
» Reasoning About Approximate Match Query Results
Sort
View
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 8 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
KCAP
2009
ACM
14 years 1 months ago
Cross ontology query answering on the semantic web: an initial evaluation
PowerAqua1 is a Question Answering system, which takes as input a natural language query and is able to return answers drawn from relevant semantic resources found anywhere on the...
Vanessa Lopez, Victoria S. Uren, Marta Sabou, Enri...
PPDP
2005
Springer
14 years 2 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ICDE
2009
IEEE
176views Database» more  ICDE 2009»
14 years 10 months ago
Efficient Table Anonymization for Aggregate Query Answering
Abstract-- Privacy protection is a major concern when microdata needs to be released for ad hoc analyses. This has led to a lot of recent research in privacy goals and table anonym...
Cecilia M. Procopiuc, Divesh Srivastava
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak