Sciweavers

193 search results - page 11 / 39
» Members of Random Closed Sets
Sort
View
DM
1999
145views more  DM 1999»
14 years 11 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
DCC
2004
IEEE
15 years 11 months ago
Multi-resolution Source Coding Using Entropy Constrained Dithered Scalar Quantization
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
Qian Zhao, Hanying Feng, Michelle Effros
IDA
2009
Springer
14 years 9 months ago
Hierarchical Extraction of Independent Subspaces of Unknown Dimensions
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
Peter Gruber, Harold W. Gutch, Fabian J. Theis
BMCBI
2008
179views more  BMCBI 2008»
14 years 11 months ago
Building pathway clusters from Random Forests classification using class votes
Background: Recent years have seen the development of various pathway-based methods for the analysis of microarray gene expression data. These approaches have the potential to bri...
Herbert Pang, Hongyu Zhao
86
Voted
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 3 months ago
Strong recombination, weak selection, and mutation
We show that there are unimodal fitness functions and genetic algorithm (GA) parameter settings where the GA, when initialized with a random population, will not move close to the...
Alden H. Wright, J. Neal Richter