4908 search results - page 31 / 982 » On the Complexity of Optimal K-Anonymity |
110
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
112
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
176
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
106
Voted
EMSOFT
2007
Springer
15 years 8 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...