Sciweavers

1274 search results - page 170 / 255
» New Proofs for
Sort
View
DAM
2008
84views more  DAM 2008»
13 years 10 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti
DM
2008
103views more  DM 2008»
13 years 10 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
IACR
2011
141views more  IACR 2011»
12 years 9 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 10 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
12 years 14 days ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...