Sciweavers

4983 search results - page 87 / 997
» order 2008
Sort
View
DCC
2008
IEEE
14 years 9 months ago
Huffman Coding with Non-sorted Frequencies
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
Shmuel Tomi Klein, Dana Shapira
DM
2006
135views more  DM 2006»
13 years 10 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman
JSYML
2008
53views more  JSYML 2008»
13 years 10 months ago
On very high degrees
In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of cert...
Keng Meng Ng
JGO
2010
89views more  JGO 2010»
13 years 8 months ago
Stopping rules in k-adaptive global random search algorithms
In this paper we develop a methodology for defining stopping rules in a general class of global random search algorithms that are based on the use of statistical procedures. To bu...
Anatoly A. Zhigljavsky, Emily Hamilton
TOG
2002
104views more  TOG 2002»
13 years 9 months ago
Improving noise
Two deficiencies in the original Noise algorithm are corrected: second order interpolation discontinuity and unoptimal gradient computation. With these defects corrected, Noise bo...
Ken Perlin