549 search results - page 33 / 110 » On the Complexity of Restricted k-anonymity Problem |
118
click to vote
CPAIOR
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
101
click to vote
INFORMATICALT
2007
15 years 1 months ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
113
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
CCCG
2010
15 years 3 months ago
2010
For a given mountain-valley pattern of equidistant creases on a long strip paper, there are many folded states consistent with the pattern. Among these folded states, we like to f...
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...