2403 search results - page 92 / 481 » Optimal Randomized RANSAC |
123
click to vote
JAIR
2006
15 years 3 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
161
click to vote
COMBINATORICA
2010
15 years 15 days ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
106
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—The problem of designing policies for in-network function computation with minimum energy consumption subject to a latency constraint is considered. The scaling behavior of the ...
141
click to vote
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
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...
143
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
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...