4908 search results - page 393 / 982 » On the Complexity of Optimal K-Anonymity |
196
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
157
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The paper presents an idea about joint use some of new technologies such as the Semantic Web, Web services and Web agents together with an already existing concept. It is a concep...
182
Voted
ALT
2008
Springer
16 years 3 months ago
2008
Springer
In numerous application areas fast growing data sets develop with ever higher complexity and dynamics. A central challenge is to filter the substantial information and to communic...
201
Voted
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper proposes a low complexity unitary precoding scheme for multiple-input multiple-output (MIMO) systems. The singular-value decomposition (SVD) based transmission is ca...
178
Voted
ICIP
2007
IEEE
16 years 1 months ago
2007
IEEE
Significant power savings can be achieved on voltage/frequency configurable platforms by dynamically adapting the frequency and voltage according to the workload (complexity). Vid...