Sciweavers

5580 search results - page 781 / 1116
» Randomized priority algorithms
Sort
View
139
Voted
AAAI
2006
15 years 4 months ago
Estimating Search Tree Size
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...
Philip Kilby, John K. Slaney, Sylvie Thiéba...
AIPS
2006
15 years 4 months ago
Reconfigurable Path Planning for an Autonomous Unmanned Aerial Vehicle
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...
Mariusz Wzorek, Patrick Doherty
144
Voted
GRAPHICSINTERFACE
2001
15 years 4 months ago
Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain
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 ...
Ryutarou Ohbuchi, Shigeo Takahashi, Takahiko Miyaz...
128
Voted
DICTA
2003
15 years 4 months ago
A Robust Method for Estimating the Fundamental Matrix
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...
C. L. Feng, Y. S. Hung
101
Voted
FLAIRS
2003
15 years 4 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings