4908 search results - page 264 / 982 » On the Complexity of Optimal K-Anonymity |
175
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
198
click to vote
PODC
1998
ACM
15 years 10 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
161
click to vote
VLDB
1987
ACM
15 years 10 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
166
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
184
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Identifying the structure of unknown molecules is an important activity in the pharmaceutical industry where it underpins the production of new drugs and the analysis of ...