Sciweavers

3422 search results - page 60 / 685
» Random Subset Optimization
Sort
View
SAGA
2007
Springer
15 years 8 months ago
Approximate Discovery of Random Graphs
In the layered-graph query model of network discovery, a query at a node v of an undirected graph G discovers all edges and non-edges whose endpoints have different distance from ...
Thomas Erlebach, Alexander Hall, Matús Miha...
ICIC
2009
Springer
15 years 1 days ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
107
Voted
ICSE
2010
IEEE-ACM
15 years 7 months ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 6 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
TIT
1998
78views more  TIT 1998»
15 years 1 months ago
Stationary Markov Random Fields on a Finite Rectangular Lattice
—This paper provides a complete characterization of stationary Markov random fields on a finite rectangular (nontoroidal) lattice in the basic case of a second-order neighborho...
Fréderic Champagnat, Jérôme Id...