Sciweavers

119 search results - page 17 / 24
» On the Complexity of Optimal Grammar-Based Compression
Sort
View
SIAMDM
1998
89views more  SIAMDM 1998»
13 years 7 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICIP
2007
IEEE
14 years 1 months ago
Buffer Constrained Proactive Dynamic Voltage Scaling for Video Decoding Systems
Significant power savings can be achieved on voltage/frequency configurable platforms by dynamically adapting the frequency and voltage according to the workload (complexity). Vid...
Emrah Akyol, Mihaela van der Schaar
ICASSP
2011
IEEE
12 years 11 months ago
Analog joint source-channel Multiple Description coding scheme over AWGN parallel channels
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN...
Aitor Erdozain, Pedro M. Crespo, Baltasar Beferull...
ICIP
1995
IEEE
14 years 9 months ago
Efficient mode selection for block-based motion compensated video coding
A method for efficiently selecting the operating modes within a block-based multi-mode video compression system is described. For a given image region, the optimum combination of ...
Thomas Wiegand, Michael Lightstone, T. George Camp...