4908 search results - page 773 / 982 » On the Complexity of Optimal K-Anonymity |
186
click to vote
EEE
2005
IEEE
16 years 6 days ago
2005
IEEE
Web services are modular web applications that can be independently deployed and invoked by other software or services on the web. This offers enterprises the capability to integr...
152
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
163
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
171
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
189
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...