4315 search results - page 159 / 863 » Sorting in linear time |
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
— A planning method for unraveling deformable linear objects based on 2D information about their crossing states is proposed. In manipulation of a linear object, its raveling mus...
MLDM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we describe a new cluster model which is based on the concept of linear manifolds. The method identifies subsets of the data which are embedded in arbitrary oriented...
ESA
2006
Springer
14 years 25 days ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
DAGSTUHL
2008
13 years 10 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Sparse linear solvers account for much of the execution time in many high-performance computing (HPC) applications, and not every solver works on all problems. Hence choosing a su...