Sciweavers

3422 search results - page 73 / 685
» Random Subset Optimization
Sort
View
AVSS
2006
IEEE
15 years 8 months ago
A Random Field Model for Improved Feature Extraction and Tracking
This paper presents a novel method for illuminationinvariant and contrast preserving feature extraction, aimed at improving performance of tracking under complex light condition. ...
Xiaotong Yuan, Stan Z. Li
112
Voted
TC
2008
15 years 2 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
BMCBI
2007
147views more  BMCBI 2007»
15 years 2 months ago
Bias in random forest variable importance measures: Illustrations, sources and a solution
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
Carolin Strobl, Anne-Laure Boulesteix, Achim Zeile...
CORR
2011
Springer
152views Education» more  CORR 2011»
14 years 9 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
15 years 3 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe