Sciweavers

4523 search results - page 25 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
KBSE
1997
IEEE
14 years 21 days ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
NIPS
2007
13 years 10 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
BMCBI
2006
198views more  BMCBI 2006»
13 years 8 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
AAAI
2008
13 years 10 months ago
Spatial Scaffolding for Sociable Robot Learning
Spatial scaffolding is a naturally occurring human teaching behavior, in which teachers use their bodies to spatially structure the learning environment to direct the attention of...
Cynthia Breazeal, Matt Berlin
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 16 days ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh