5606 search results - page 819 / 1122 » Randomization Techniques for Graphs. |
224
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
161
click to vote
MST
2010
15 years 5 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
179
click to vote
PPDP
2010
Springer
15 years 5 months ago
2010
Springer
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
157
click to vote
PVLDB
2010
15 years 5 months ago
2010
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a...
172
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...