4908 search results - page 277 / 982 » On the Complexity of Optimal K-Anonymity |
139
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We investigate tradeoffs of various basic complexity measures such as size, space and width. We show examples of formulas that have optimal proofs with respect to any one of these...
145
click to vote
MEMOCODE
2007
IEEE
16 years 29 days ago
2007
IEEE
This design presents a system optimized for complex matrix multiplications on the XUP Virtex-II board. Utilizing the GEZEL HW/SW co-simulation environment, the resulting system ac...
165
click to vote
DATE
2006
IEEE
16 years 22 days ago
2006
IEEE
Partitioning is a time consuming and computationally complex optimization problem in the codesign of hardware software systems. The stringent time-to-market requirements have resu...
179
click to vote
ICRA
2005
IEEE
16 years 8 days ago
2005
IEEE
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
133
click to vote
ICTAI
2005
IEEE
16 years 8 days ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...