Sciweavers

1114 search results - page 20 / 223
» Better Construction with Factories
Sort
View
EXPERT
1998
83views more  EXPERT 1998»
14 years 9 months ago
Data-Driven Constructive Induction
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...
Eric Bloedorn, Ryszard S. Michalski
FOCS
1990
IEEE
15 years 1 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
EVOW
2006
Springer
15 years 1 months ago
The Effect of Building Block Construction on the Behavior of the GA in Dynamic Environments: A Case Study Using the Shaky Ladder
The shaky ladder hyperplane-defined functions (sl-hdf's) are a test suite utilized for exploring the behavior of the genetic algorithm (GA) in dynamic environments. We present...
William Rand, Rick L. Riolo
DCC
2009
IEEE
15 years 10 months ago
Linear Suffix Array Construction by Almost Pure Induced-Sorting
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Ge Nong, Sen Zhang, Wai Hong Chan
ICMCS
2006
IEEE
102views Multimedia» more  ICMCS 2006»
15 years 3 months ago
An Efficient Memory Construction Scheme for an Arbitrary Side Growing Huffman Table
By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGHtree), we construct a memory efficient Huffman table on the ba...
Sung-Wen Wang, Shang-Chih Chuang, Chih-Chieh Hsiao...