4908 search results - page 683 / 982 » On the Complexity of Optimal K-Anonymity |
224
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
177
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
This paper presents a novel technique, called input space adaptive software synthesis, for the energy and performance optimization of embedded software. The proposed technique is ...
178
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
159
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Ultra-deep submicron manufacturability impacts physical design (PD) through complex layout rules and large guardbands for process variability; this creates new requirements for ne...
211
Voted
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...