Sciweavers

4934 search results - page 118 / 987
» complexity 2008
Sort
View
ICC
2008
IEEE
121views Communications» more  ICC 2008»
15 years 10 months ago
Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels
— This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual ...
Natasa Blitvic, Lizhong Zheng, Vladimir Stojanovic
MMSP
2008
IEEE
146views Multimedia» more  MMSP 2008»
15 years 10 months ago
A new low complex reference free video quality predictor
—In many applications and environments for mobile communication there is a need for reference free perceptual quality measurements. In this paper a method for prediction of a num...
Andreas Rossholm, Benny Lövström
PRDC
2008
IEEE
15 years 10 months ago
On the Complexity of a Self-Stabilizing Spanning Tree Algorithm for Large Scale Systems
Many large scale systems, like grids and structured peer to peer systems, operate on a constrained topology. Since underlying networks do not expose the real topology to the appli...
Julien Clement, Thomas Hérault, Stép...
AAAI
2008
15 years 6 months ago
Generating Application-Specific Benchmark Models for Complex Systems
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
Jun Wang, Gregory M. Provan
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 6 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan