4908 search results - page 94 / 982 » On the Complexity of Optimal K-Anonymity |
165
click to vote
ISPASS
2010
IEEE
16 years 1 months ago
2010
IEEE
—While many-core accelerator architectures, such as today’s Graphics Processing Units (GPUs), offer orders of magnitude more raw computing power than contemporary CPUs, their m...
171
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Edges in man-made environments, grouped according to vanishing point directions, provide single-view constraints that have been exploited before as a precursor to both scene under...
173
click to vote
COMPGEOM
2009
ACM
16 years 24 days ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
145
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
267
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...