Sciweavers

5115 search results - page 197 / 1023
» On Randomized Lanczos Algorithms
Sort
View
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 7 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
SIGPRO
2002
58views more  SIGPRO 2002»
15 years 6 months ago
A HMM approach to the estimation of random trajectories on manifolds
Dynamic image analysis requires the estimation of time-varying model parameters (e.g., shape coe cients). This can be11 seen as states of a dynamic model which are restricted to a...
Jorge S. Marques, João Miranda Lemos, Arnal...
200
Voted
PAMI
2010
249views more  PAMI 2010»
15 years 5 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...
184
Voted
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
15 years 5 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 7 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 ...