Sciweavers

4908 search results - page 203 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche
ICASSP
2011
IEEE
14 years 10 months ago
Reusing the H.264/AVC deblocking filter for efficient spatio-temporal prediction in video coding
The prediction step is a very important part of hybrid video codecs for effectively compressing video sequences. While existing video codecs predict either in temporal or in spati...
Jürgen Seiler, André Kaup
ICASSP
2011
IEEE
14 years 10 months ago
Non-linear tagging models with localist and distributed word representations
Distributed representations of words are attractive since they provide a means for measuring word similarity. However, most approaches to learning distributed representations are ...
Sumit Chopra, Srinivas Bangalore
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 3 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
DT
2000
101views more  DT 2000»
15 years 6 months ago
Conflicting Criteria in Embedded System Design
The design of complex embedded systems involves the simultaneous optimization of several often competing objectives. Instead of a single optimal design, there is rather a set of a...
Michael Eisenring, Lothar Thiele, Eckart Zitzler