4908 search results - page 763 / 982 » On the Complexity of Optimal K-Anonymity |
167
click to vote
IESS
2007
Springer
16 years 23 days ago
2007
Springer
: Much effort in RTL design has been devoted to developing “push-button” types of tools. However, given the highly complex nature, and lack of control on RTL design, push-butt...
188
click to vote
ILP
2007
Springer
16 years 22 days ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
165
click to vote
IPSN
2007
Springer
16 years 22 days ago
2007
Springer
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
165
click to vote
ISAAC
2007
Springer
16 years 22 days ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
147
click to vote
ISNN
2007
Springer
16 years 22 days ago
2007
Springer
Modeling for the ball mill grinding process is still an imperative but difficult problem for the optimal control of mineral processing industry. Due to the integrated complexities ...