4114 search results - page 289 / 823 » Efficient Algorithms for the 2-Center Problems |
232
click to vote
FAW
2010
Springer
15 years 6 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
165
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
192
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...
176
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...
170
Voted
PVLDB
2008
15 years 6 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...