5115 search results - page 689 / 1023 » On Randomized Lanczos Algorithms |
185
click to vote
NIPS
2008
15 years 8 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
179
click to vote
AAAI
2006
15 years 8 months ago
2006
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
191
click to vote
AIPS
2006
15 years 8 months ago
2006
In this paper, we present a motion planning framework for a fully deployed autonomous unmanned aerial vehicle which integrates two sample-based motion planning techniques, Probabi...
191
click to vote
GRAPHICSINTERFACE
2001
15 years 8 months ago
2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright ...
173
click to vote
DICTA
2003
15 years 8 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...