4908 search results - page 848 / 982 » On the Complexity of Optimal K-Anonymity |
151
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— We present a novel Weighted Barrier Function (WBF) method of efficiently computing optimal grasping force distributions for multifingered hands. Second-order conic friction c...
175
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—Opportunistic routing significantly increases unicast throughput in wireless mesh networks by effectively utilizing the wireless broadcast medium. With network coding, opportun...
180
click to vote
INFORMS
2010
15 years 4 months ago
2010
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
184
click to vote
TCAD
2008
15 years 4 months ago
2008
The design of MultiProcessor Systems-on-Chip (MPSoC) emphasizes intellectual-property (IP)-based communication-centric approaches. Therefore, for the optimization of the MPSoC inte...
140
click to vote
JPDC
2010
15 years 4 months ago
2010
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...