4908 search results - page 161 / 982 » On the Complexity of Optimal K-Anonymity |
135
click to vote
ISCAS
2006
IEEE
16 years 15 days ago
2006
IEEE
— We present analytical formulas for the calculation of the memory requirements for a system using the Complex Logarithmic Number System (CLNS). Certain properties of the CLNS ad...
180
click to vote
EUROPAR
2005
Springer
16 years 12 hour ago
2005
Springer
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
222
click to vote
ACID
2006
15 years 8 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
119
click to vote
WSCG
2001
15 years 7 months ago
2001
the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simul...
195
click to vote
DAM
2002
15 years 6 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...