4908 search results - page 625 / 982 » On the Complexity of Optimal K-Anonymity |
160
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Multiple robots are often faster and more faulttolerant than single robots for applications such as planetary exploration and search and rescue. We study applications w...
170
click to vote
NOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
186
Voted
SEMCO
2007
IEEE
16 years 1 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
186
click to vote
SIPS
2007
IEEE
16 years 1 months ago
2007
IEEE
In this paper, we present a fast mode decision algorithm for H.264/AVC intra prediction. The goal of this work is to reduce computational complexity of the H.264 encoder without s...
197
Voted
VTC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We address the problem of radio resource allocation in the Downlink (DL) of a cellular system with Relay Stations (RS), based on Orthogonal Frequency Division Multiple Access (...