4908 search results - page 210 / 982 » On the Complexity of Optimal K-Anonymity |
180
click to vote
JACM
2000
15 years 6 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
177
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
158
click to vote
CCGRID
2008
IEEE
16 years 1 months ago
2008
IEEE
Distributed applications tend to have a complex design due to issues such as concurrency, synchronization and communication. Researchers in the past have proposed abstractions to ...
166
click to vote
DATE
2008
IEEE
2008
IEEE
An Optimized Message Passing Framework for Parallel Implementation of Signal Processing Applications
16 years 1 months ago
Novel reconfigurable computing platforms enable efficient realizations of complex signal processing applications by allowing exploitation of parallelization resulting in high thro...
157
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this contribution, a novel soft-output Ant Colony Optimization (ACO) based Multi-User Detector (MUD) is proposed for the synchronous Direct-Sequence Code-DivisionMultiple-Ac...