4908 search results - page 834 / 982 » On the Complexity of Optimal K-Anonymity |
157
click to vote
FMSD
2007
15 years 6 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
153
click to vote
OL
2008
15 years 6 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
159
click to vote
MP
2006
15 years 6 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
175
click to vote
IEEEMM
2007
15 years 6 months ago
2007
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
180
click to vote
NPL
2006
15 years 6 months ago
2006
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...