4908 search results - page 353 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
164
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
175
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
171
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Using CDMA technology, one has to contend with interference in frequency-selective channels caused by multipath propagation and fading. Transmitter-based methods such as Zero Fo...
213
click to vote
ISCAS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Reordered normal basis is a certain permutation of a type II optimal normal basis. In this paper, a high speed design of a word level finite field multiplier using reordered ...