Sciweavers

22588 search results - page 4221 / 4518
» On simulation model complexity
Sort
View
SPIRE
2010
Springer
15 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
SYNTHESE
2010
59views more  SYNTHESE 2010»
15 years 5 months ago
Frege's Begriffsschrift as a lingua characteristica
In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua ch...
Tapio Korte
TCOM
2010
167views more  TCOM 2010»
15 years 5 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
TIP
2010
123views more  TIP 2010»
15 years 5 months ago
Optimizing Motion Compensated Prediction for Error Resilient Video Coding
—This paper is concerned with optimization of the motion compensated prediction framework to improve the error resilience of video coding for transmission over lossy networks. Fi...
Hua Yang, Kenneth Rose
TIP
2010
108views more  TIP 2010»
15 years 5 months ago
A Perceptually Relevant Approach to Ringing Region Detection
—An efficient approach toward a no-reference ringing metric intrinsically exists of two steps: first detecting regions in an image where ringing might occur, and second quantif...
Hantao Liu, Nick Klomp, Ingrid Heynderickx
« Prev « First page 4221 / 4518 Last » Next »