Sciweavers

2252 search results - page 107 / 451
» Improving Random Forests
Sort
View
ECCV
2008
Springer
14 years 10 months ago
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
ICPR
2004
IEEE
14 years 9 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 8 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
ICPR
2010
IEEE
14 years 3 months ago
Continuous Markov Random Field Optimization using Fusion Move Driven Markov Chain Monte Carlo Technique
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
Wonsik Kim (Seoul National University), Kyoung Mu ...
GLOBECOM
2008
IEEE
14 years 2 months ago
Cooperative MAC for Rate Adaptive Randomized Distributed Space-Time Coding
—In a distributed wireless network, it is possible to employ several relays and mimic a multiple antenna transmission system. In this paper we propose a MAC layer solution that a...
Pei Liu, Yuanpeng Liu, Thanasis Korakis, Anna Scag...