Sciweavers

522 search results - page 73 / 105
» Necessary but Not Sufficient
Sort
View
ICDE
2007
IEEE
1577views Database» more  ICDE 2007»
17 years 5 months ago
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to...
Ninghui Li, Tiancheng Li, Suresh Venkatasubramania...
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 6 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
JUCS
2002
110views more  JUCS 2002»
15 years 5 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
SIAMMAX
2010
164views more  SIAMMAX 2010»
15 years 25 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ATAL
2010
Springer
15 years 7 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer