Sciweavers

4 search results - page 1 / 1
» Aggregation Functions with Stronger Types of Monotonicity
Sort
View
IPMU
2010
Springer
13 years 3 months ago
Aggregation Functions with Stronger Types of Monotonicity
Following the ideas of stronger forms of monotonicity for unary real functions and for capacities, k-monotone and strongly kmonotone aggregation functions are introduced and discus...
Erich-Peter Klement, Maddalena Manzi, Radko Mesiar
ICFP
2010
ACM
13 years 6 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 5 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
PVLDB
2010
93views more  PVLDB 2010»
13 years 3 months ago
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation
The goal of a threshold query is to detect all objects whose score exceeds a given threshold. This type of query is used in many settings, such as data mining, event triggering, a...
Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Sch...