9405 search results - page 209 / 1881 » Computing a Model of Set Theory |
137
Voted
LPNMR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
178
Voted
DCOSS
2008
Springer
15 years 5 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
137
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
133
Voted
IACR
2011
14 years 3 months ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
111
click to vote
ICTAC
2009
Springer
15 years 10 months ago
2009
Springer
“Classical” program development by refinement [12, 2, 3] is a technique for ensuring that source-level program code remains faithful to the semantic goals set out in its corre...