4908 search results - page 655 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
ECRTS
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
188
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
195
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...
164
click to vote
EWSA
2006
Springer
15 years 10 months ago
2006
Springer
Assembling software components into an architecture is a difficult task because of its combinatorial complexity. There is thus a need for automating this building process, either t...
191
click to vote
ARITH
2001
IEEE
15 years 10 months ago
2001
IEEE
A recently introduced double-base number representation has proved to be successful in optimizing the performance of several algorithms in cryptography and digital signal processi...