4908 search results - page 10 / 982 » On the Complexity of Optimal K-Anonymity |
118
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
106
click to vote
TNN
2011
14 years 6 months ago
2011
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
151
click to vote
WINE
2010
Springer
14 years 9 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
IOR
2011
14 years 6 months ago
2011
We consider a pricing problem in an environment where the customers’ willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive se...
DEXA
2003
Springer
15 years 4 months ago
2003
Springer
Query optimizers in current database management systems (DBMS) often face problems such as intolerably long optimization time and/or poor optimization results when optimizing compl...