2356 search results - page 93 / 472 » Characterizations of postman sets |
133
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
147
click to vote
AMAI
2006
Springer
15 years 4 months ago
2006
Springer
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
127
click to vote
LOGCOM
2007
15 years 4 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
129
click to vote
VMCAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...
112
click to vote
DM
2008
15 years 4 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....