4908 search results - page 17 / 982 » On the Complexity of Optimal K-Anonymity |
ICRA
2010
IEEE
15 years 13 days ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
123
click to vote
INFOCOM
1995
IEEE
15 years 5 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
106
click to vote
AIPS
2008
15 years 4 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
116
click to vote
ICDE
2006
IEEE
15 years 8 months ago
2006
IEEE
Due to the flexible structures of SQL, no general approach works efficiently for all kinds of queries. Some special kinds of queries can be further optimized for better performa...
111
click to vote
TCOM
2008
15 years 1 months ago
2008
This letter presents a new method to directly analyze and optimize symbol error rate (SER) performance of minimum decoding complexity (MDC) ABBA space-time block codes based on a t...