4112 search results - page 278 / 823 » Efficient Algorithms for the Spoonerism Problem |
197
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
182
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper the problem of positioning a team of mobile robots for a surveillance task in a non-convex environment with obstacles is considered. The robots are equipped with glob...
221
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper introduces an efficient algorithm that reconstructs 3D human poses as well as camera parameters from a small number of 2D point correspondences obtained from uncalibrat...
177
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
158
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...