Sciweavers

1418 search results - page 40 / 284
» Schema polynomials and applications
Sort
View
COCO
2003
Springer
88views Algorithms» more  COCO 2003»
15 years 9 months ago
On Derandomizing Tests for Certain Polynomial Identities
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
Manindra Agrawal
WWW
2006
ACM
16 years 5 months ago
Bootstrapping semantics on the web: meaning elicitation from schemas
In most web sites, web-based applications (such as web portals, emarketplaces, search engines), and in the file systems of personal computers, a wide variety of schemas (such as t...
Paolo Bouquet, Luciano Serafini, Stefano Zanobini,...
SIGMOD
2007
ACM
147views Database» more  SIGMOD 2007»
16 years 4 months ago
Extending relational query optimization to dynamic schemas for information integration in multidatabases
This paper extends relational processing and optimization to the FISQL/FIRA languages for dynamic schema queries over multidatabases. Dynamic schema queries involve the creation a...
Catharine M. Wyss, Felix I. Wyss
EDBT
2010
ACM
200views Database» more  EDBT 2010»
15 years 11 months ago
Rewrite techniques for performance optimization of schema matching processes
A recurring manual task in data integration, ontology alignment or model management is finding mappings between complex meta data structures. In order to reduce the manual effor...
Eric Peukert, Henrike Berthold, Erhard Rahm
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
15 years 10 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker