Sciweavers

2143 search results - page 121 / 429
» corr 2010
Sort
View
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 11 days ago
Improved Inapproximability For Submodular Maximization
We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a ...
Per Austrin
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 11 months ago
Computational Complexity of Iterated Maps on the Interval
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is ch...
Christoph Spandl
103
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
14 years 11 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
Toby Walsh
82
Voted
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 26 days ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 26 days ago
Using Coloured Petri Nets for design of parallel raytracing environment
Abstract. This paper deals with the parallel raytracing part of virtualreality system PROLAND, developed at the home institution of authors. It describes an actual implementation o...
Stefan Korecko, Branislav Sobota