191 search results - page 28 / 39 » Extending the Relational Algebra to Support Transaction Time |
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
IEEEARES
2010
IEEE
15 years 2 months ago
2010
IEEE
—Today’s rich service offer in the World Wide Web increasingly requires the disclosure of personal user data. Service providers’ appetite for personal user data, however, is ...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
TIT
2002
14 years 9 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...