1464 search results - page 129 / 293 » On optimal anonymization for l -diversity |
124
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper considers the problem of minimizing roundoff noise in two-dimensional (2-D) state-space digital filters subject to L2-norm dynamic-range scaling constraints. The mini...
145
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees of arbitrary ...
147
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper reports the mechanical design, structural analysis, and experimental veri cation of a new high performance semi-direct drive robot arm. A design optimization methodolog...
193
click to vote
ISSAC
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
175
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...