Sciweavers

2354 search results - page 199 / 471
» Randomness, Stochasticity and Approximations
Sort
View
BIOINFORMATICS
2006
85views more  BIOINFORMATICS 2006»
13 years 9 months ago
Clusterv: a tool for assessing the reliability of clusters discovered in DNA microarray data
Summary: We present a new R package for the assessment of the reliability of clusters discovered in high dimensional DNA microarray data. The package implements methods based on r...
Giorgio Valentini
IJON
2008
118views more  IJON 2008»
13 years 9 months ago
Incremental extreme learning machine with fully complex hidden nodes
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879
Guang-Bin Huang, Ming-Bin Li, Lei Chen, Chee Kheon...
MICCAI
2008
Springer
14 years 11 months ago
Segmenting Brain Tumors Using Pseudo-Conditional Random Fields
Locating Brain tumor segmentation within MR (magnetic resonance) images is integral to the treatment of brain cancer. This segmentation task requires classifying each voxel as eith...
Chi-Hoon Lee, Shaojun Wang, Albert Murtha, Matt...
FOCS
2009
IEEE
14 years 4 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
APPROX
2005
Springer
122views Algorithms» more  APPROX 2005»
14 years 3 months ago
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Uriel Feige, Eran Ofek