4908 search results - page 269 / 982 » On the Complexity of Optimal K-Anonymity |
211
click to vote
JMLR
2010
15 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
154
click to vote
PVLDB
2010
15 years 5 months ago
2010
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
173
click to vote
SIROCCO
2010
15 years 5 months ago
2010
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
197
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
195
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...