4908 search results - page 233 / 982 » On the Complexity of Optimal K-Anonymity |
209
click to vote
ICANN
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
166
click to vote
HSNMC
2004
Springer
15 years 12 months ago
2004
Springer
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
190
click to vote
DEXAW
2003
IEEE
15 years 12 months ago
2003
IEEE
We present the framework of a new grid architecture based on the peer-to-peer and the component paradigms. In our architecture, several peer-to-peer components are loosely coupled...
184
click to vote
ATAL
2003
Springer
15 years 12 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
125
click to vote
EGH
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we present several optimizations to our previously presented soft shadow volume algorithm. Our optimizations include tighter wedges, heavily optimized pixel shader ...