Sciweavers

4908 search results - page 108 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DATE
2010
IEEE
174views Hardware» more  DATE 2010»
15 years 4 months ago
An HVS-based Adaptive Computational Complexity Reduction Scheme for H.264/AVC video encoder using Prognostic Early Mode Exclusio
The H.264/AVC video encoder standard significantly improves the compression efficiency by using variable block-sized Inter (P) and Intra (I) Macroblock (MB) coding modes. In this p...
Muhammad Shafique, Bastian Molkenthin, Jörg H...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 6 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
VTC
2008
IEEE
123views Communications» more  VTC 2008»
16 years 23 days ago
A Low-Complexity Iterative Power Allocation Scheme for Multiuser OFDM Systems
—Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for future wide-area mobile communications, which can provide scalable high data rate tra...
Chin-Liang Wang, Chiuan-Hsu Chen
ICANN
2005
Springer
15 years 12 months ago
Learning Features of Intermediate Complexity for the Recognition of Biological Motion
Humans can recognize biological motion from strongly impoverished stimuli, like point-light displays. Although the neural mechanism underlying this robust perceptual process have n...
Rodrigo Sigala, Thomas Serre, Tomaso Poggio, Marti...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 12 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...