4908 search results - page 735 / 982 » On the Complexity of Optimal K-Anonymity |
171
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
179
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
Our objective was to determine the most energy efficient 64b static CMOS adder architecture, for a range of high-performance delay targets. We examine extensively carry-lookahead ...
181
click to vote
ICCAD
2007
IEEE
16 years 3 months ago
2007
IEEE
While the increasing need for addressing process variability in sub-90nm VLSI technologies has sparkled a large body of statistical timing and optimization research, the realizati...
185
click to vote
FPGA
2010
ACM
16 years 3 months ago
2010
ACM
Deep submicron processes have allowed FPGAs to grow in complexity and speed. However, such technology scaling has caused FPGAs to become more susceptible to the effects of process...
203
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We present two novel methods to automatically learn spatio-temporal dependencies of moving agents in complex dynamic scenes. They allow to discover temporal rules, such as the rig...