503 search results - page 96 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
CCCG
2010
14 years 11 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...
ICCV
1995
IEEE
15 years 1 months ago
1995
IEEE
Computational vision algorithms are often developed in a Bayesian framework. Two estimators are commonly used: maximum a posteriori (MAP), and minimum mean squared error (MMSE). W...
79
Voted
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
IIS
2003
14 years 10 months ago
2003
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
ISCAS
2008
IEEE
15 years 3 months ago
2008
IEEE
Abstract—For an intelligent multi-camera multi-object surveillance system, object correspondence across time and space is important to many smart visual applications. In this pap...