1012 search results - page 70 / 203 » Segment intersection searching problems in general settings |
113
click to vote
ASIAN
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
104
click to vote
CVPR
2006
IEEE
15 years 5 months ago
2006
IEEE
The mean shift algorithm is widely applied for nonparametric clustering in Euclidean spaces. Recently, mean shift was generalized for clustering on matrix Lie groups. We further e...
111
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper we aim at reconstructing 3D scenes from images
with unknown focal lengths downloaded from photosharing
websites such as Flickr. First we provide a minimal
solution...
108
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
AAAI
2008
15 years 2 months ago
2008
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...