1418 search results - page 77 / 284 » Schema polynomials and applications |
130
click to vote
FPL
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
159
click to vote
PKC
1999
Springer
15 years 10 months ago
1999
Springer
This paper introduces a method for tracking different copies of functionally equivalent algorithms containing identification marks known to the attacker. Unlike all previous solu...
224
click to vote
FOCS
1992
IEEE
15 years 10 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
180
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
A Web Application must have a precise semantics. In currently Web Engineering environments, this can be achieved either by specifying a Web Conceptual Schema, or by using a Semant...
260
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...