2652 search results - page 348 / 531 » Privacy-preserving linear programming |
172
click to vote
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
134
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...
162
click to vote
JSAC
2008
15 years 1 months ago
2008
In this paper we design a cognitive radio that can coexist with multiple parallel WLAN channels while abiding by an interference constraint. The interaction between both systems is...
116
click to vote
MIG
2010
Springer
15 years 1 months ago
2010
Springer
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
128
click to vote
MP
2010
15 years 1 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...