1033 search results - page 35 / 207 » The Relative History Heuristic |
COCOA
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
AISC
2006
Springer
15 years 3 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
194
click to vote
DCC
2011
IEEE
14 years 6 months ago
2011
IEEE
Quantizers for probabilistic sources are usually optimized for mean-squared error. In many applications, maintaining low relative error is a more suitable objective. This measure ...
169
click to vote
SIGMOD
2005
ACM
15 years 12 months ago
2005
ACM
We demonstrate a prototype of the relational data mapping module of MIQIS, a formal framework for investigating information flow in peer-to-peer database management systems. Data ...
106
click to vote
OTM
2005
Springer
15 years 5 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...