705 search results - page 71 / 141 » Approximating Extended Answer Sets |
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
A granular based semantics for fuzzy measures is introduced in which the measure of a set of propositions approximates the probability of the disjunction of these propositions. Th...
CP
2008
Springer
15 years 1 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
126
click to vote
TCC
2012
Springer
13 years 7 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
122
click to vote
JACM
2012
13 years 2 months ago
2012
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
TIT
2008
14 years 11 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...