11397 search results - page 127 / 2280 » A Relational Abstraction for Functions |
177
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
141
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Agents interacting in open environments such as Internet are often in charge of personal information. In order to protect the privacy of human users, such agents have to ...
173
click to vote
DCG
2010
15 years 1 months ago
2010
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
171
click to vote
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas ca...
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce ...