Sciweavers

5153 search results - page 205 / 1031
» Introduction to Randomized Algorithms
Sort
View
PAMI
2010
249views more  PAMI 2010»
15 years 1 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 1 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
BMCBI
2006
198views more  BMCBI 2006»
15 years 3 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 ...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 5 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
ICDAR
2007
IEEE
15 years 9 months ago
Using Random Forests for Handwritten Digit Recognition
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
Simon Bernard, Sébastien Adam, Laurent Heut...