450 search results - page 87 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
105
click to vote
ALGOSENSORS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
117
click to vote
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
110
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
121
click to vote
SIGGRAPH
1992
ACM
15 years 3 months ago
1992
ACM
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
SIROCCO
2008
15 years 1 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...