Sciweavers

11949 search results - page 175 / 2390
» Some results on (a:b)-choosability
Sort
View
DATASCIENCE
2007
74views more  DATASCIENCE 2007»
15 years 28 days ago
The relative efficiency of data compression by LZW and LZSS
We explore the use of the LZW and LZSS data compression methods. These methods or some versions of them are very common in use of compressing different types of data. Even though ...
Yair Wiseman
ORL
2007
82views more  ORL 2007»
15 years 26 days ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
ORL
2007
96views more  ORL 2007»
15 years 26 days ago
A note on scenario reduction for two-stage stochastic programs
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
Holger Heitsch, Werner Römisch
CORR
2010
Springer
44views Education» more  CORR 2010»
14 years 12 months ago
Combinatorial substitutions and sofic tilings
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings ar...
Thomas Fernique, Nicolas Ollinger
JAT
2010
62views more  JAT 2010»
14 years 11 months ago
Pointwise estimates for polynomial approximation on the semiaxis
We state some pointwise estimates for the rate of weighted approximation of a continuous function on the semiaxis by polynomials. Similarly to a previous result in C[−1, 1] due ...
Giuseppe Mastroianni, Woula Themistoclakis