10414 search results - page 248 / 2083 » An efficient algorithm for Co-segmentation |
174
click to vote
DAGM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
227
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
187
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
162
click to vote
IMR
1998
Springer
15 years 10 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
193
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...